./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 15:00:41,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:00:41,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:00:41,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:00:41,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:00:41,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:00:41,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:00:41,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:00:41,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:00:41,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:00:41,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:00:41,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:00:41,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:00:41,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:00:41,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:00:41,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:00:41,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:00:41,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:00:41,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:00:41,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:00:41,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:00:41,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:00:41,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:00:41,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:00:41,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:00:41,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:00:41,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:00:41,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:00:41,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:00:41,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:00:41,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:00:41,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:00:41,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:00:41,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:00:41,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:00:41,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:00:41,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:00:41,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:00:41,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:00:41,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:00:41,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:00:41,647 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 15:00:41,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:00:41,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:00:41,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:00:41,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:00:41,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:00:41,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:00:41,663 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:00:41,663 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:00:41,663 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:00:41,663 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:00:41,663 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:00:41,663 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:00:41,664 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:00:41,664 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:00:41,664 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:00:41,664 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:00:41,664 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:00:41,664 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:00:41,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:00:41,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:00:41,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:00:41,665 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:00:41,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:00:41,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:00:41,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:00:41,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:00:41,666 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:00:41,666 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:00:41,666 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:00:41,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:00:41,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:00:41,666 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:00:41,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:00:41,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:00:41,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:00:41,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:00:41,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:00:41,667 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:00:41,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:00:41,667 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:00:41,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:00:41,667 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:00:41,667 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-12-14 15:00:41,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:00:41,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:00:41,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:00:41,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:00:41,855 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:00:41,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/heap-manipulation/dancing.i [2022-12-14 15:00:44,434 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:00:44,618 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:00:44,619 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/sv-benchmarks/c/heap-manipulation/dancing.i [2022-12-14 15:00:44,627 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/data/659793037/f77eff5bafb4421fb4d347ac07605df1/FLAGecc34a9e4 [2022-12-14 15:00:44,640 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/data/659793037/f77eff5bafb4421fb4d347ac07605df1 [2022-12-14 15:00:44,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:00:44,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:00:44,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:00:44,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:00:44,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:00:44,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6318b742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44, skipping insertion in model container [2022-12-14 15:00:44,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:00:44,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:00:44,798 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-12-14 15:00:44,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:00:44,879 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:00:44,887 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-12-14 15:00:44,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:00:44,923 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:00:44,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44 WrapperNode [2022-12-14 15:00:44,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:00:44,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:00:44,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:00:44,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:00:44,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,953 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-12-14 15:00:44,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:00:44,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:00:44,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:00:44,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:00:44,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,972 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:00:44,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:00:44,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:00:44,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:00:44,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (1/1) ... [2022-12-14 15:00:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:00:44,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:00:45,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:00:45,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:00:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-12-14 15:00:45,047 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-12-14 15:00:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 15:00:45,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 15:00:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:00:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:00:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:00:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 15:00:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 15:00:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:00:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:00:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:00:45,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:00:45,141 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:00:45,142 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:00:45,443 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:00:45,468 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:00:45,468 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 15:00:45,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:00:45 BoogieIcfgContainer [2022-12-14 15:00:45,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:00:45,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:00:45,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:00:45,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:00:45,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:00:44" (1/3) ... [2022-12-14 15:00:45,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646630e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:00:45, skipping insertion in model container [2022-12-14 15:00:45,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:00:44" (2/3) ... [2022-12-14 15:00:45,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646630e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:00:45, skipping insertion in model container [2022-12-14 15:00:45,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:00:45" (3/3) ... [2022-12-14 15:00:45,477 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-12-14 15:00:45,490 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:00:45,491 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-12-14 15:00:45,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:00:45,526 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@542a4f0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:00:45,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-12-14 15:00:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 45 states have (on average 2.2) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:00:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 15:00:45,533 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:45,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 15:00:45,533 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 6700, now seen corresponding path program 1 times [2022-12-14 15:00:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:45,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857954295] [2022-12-14 15:00:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:45,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:45,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857954295] [2022-12-14 15:00:45,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857954295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:45,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:45,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:00:45,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616308743] [2022-12-14 15:00:45,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:45,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:00:45,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:45,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:00:45,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:45,698 INFO L87 Difference]: Start difference. First operand has 98 states, 45 states have (on average 2.2) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:45,805 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-12-14 15:00:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:00:45,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 15:00:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:45,813 INFO L225 Difference]: With dead ends: 96 [2022-12-14 15:00:45,813 INFO L226 Difference]: Without dead ends: 95 [2022-12-14 15:00:45,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:45,816 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:45,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 79 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-14 15:00:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-12-14 15:00:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 45 states have (on average 2.111111111111111) internal successors, (95), 86 states have internal predecessors, (95), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:00:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-12-14 15:00:45,849 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 2 [2022-12-14 15:00:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:45,850 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-12-14 15:00:45,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-12-14 15:00:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 15:00:45,850 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:45,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 15:00:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:00:45,851 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:45,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash 6701, now seen corresponding path program 1 times [2022-12-14 15:00:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:45,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862690660] [2022-12-14 15:00:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:45,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:45,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:45,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862690660] [2022-12-14 15:00:45,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862690660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:45,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:45,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:00:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619587647] [2022-12-14 15:00:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:45,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:00:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:00:45,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:45,929 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:46,051 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2022-12-14 15:00:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:00:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 15:00:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:46,053 INFO L225 Difference]: With dead ends: 152 [2022-12-14 15:00:46,053 INFO L226 Difference]: Without dead ends: 152 [2022-12-14 15:00:46,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:46,054 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 60 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:46,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 163 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-14 15:00:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 93. [2022-12-14 15:00:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 45 states have (on average 2.066666666666667) internal successors, (93), 84 states have internal predecessors, (93), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:00:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2022-12-14 15:00:46,062 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 2 [2022-12-14 15:00:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:46,062 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2022-12-14 15:00:46,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2022-12-14 15:00:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:00:46,062 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:46,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:00:46,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:00:46,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:46,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1897110090, now seen corresponding path program 1 times [2022-12-14 15:00:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:46,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894223013] [2022-12-14 15:00:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:46,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894223013] [2022-12-14 15:00:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894223013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:46,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:46,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:00:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379726281] [2022-12-14 15:00:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:46,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:00:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:00:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:46,117 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:46,208 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-12-14 15:00:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:00:46,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:00:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:46,210 INFO L225 Difference]: With dead ends: 150 [2022-12-14 15:00:46,210 INFO L226 Difference]: Without dead ends: 150 [2022-12-14 15:00:46,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:46,212 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 66 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:46,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 119 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-14 15:00:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-12-14 15:00:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 45 states have (on average 2.022222222222222) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:00:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2022-12-14 15:00:46,218 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 6 [2022-12-14 15:00:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:46,218 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2022-12-14 15:00:46,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2022-12-14 15:00:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:00:46,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:46,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:00:46,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:00:46,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1897110091, now seen corresponding path program 1 times [2022-12-14 15:00:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:46,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988362742] [2022-12-14 15:00:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:46,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:46,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988362742] [2022-12-14 15:00:46,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988362742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:46,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:46,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:00:46,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647221977] [2022-12-14 15:00:46,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:46,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:00:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:00:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:46,296 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:46,397 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2022-12-14 15:00:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:00:46,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:00:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:46,399 INFO L225 Difference]: With dead ends: 150 [2022-12-14 15:00:46,399 INFO L226 Difference]: Without dead ends: 150 [2022-12-14 15:00:46,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:46,400 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 66 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:46,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 149 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-14 15:00:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 89. [2022-12-14 15:00:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 80 states have internal predecessors, (89), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:00:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2022-12-14 15:00:46,406 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 6 [2022-12-14 15:00:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:46,406 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2022-12-14 15:00:46,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2022-12-14 15:00:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:00:46,406 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:46,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:46,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:00:46,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2076841129, now seen corresponding path program 1 times [2022-12-14 15:00:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:46,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940449193] [2022-12-14 15:00:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:46,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:46,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940449193] [2022-12-14 15:00:46,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940449193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:46,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:46,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:00:46,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449644618] [2022-12-14 15:00:46,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:46,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:00:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:46,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:00:46,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:00:46,483 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:46,567 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2022-12-14 15:00:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:00:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 15:00:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:46,569 INFO L225 Difference]: With dead ends: 160 [2022-12-14 15:00:46,569 INFO L226 Difference]: Without dead ends: 160 [2022-12-14 15:00:46,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:00:46,570 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 70 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:46,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 335 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-12-14 15:00:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2022-12-14 15:00:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 110 states have internal predecessors, (153), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 15:00:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2022-12-14 15:00:46,577 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 8 [2022-12-14 15:00:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:46,577 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2022-12-14 15:00:46,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2022-12-14 15:00:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:00:46,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:46,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:46,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:00:46,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:46,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2056662894, now seen corresponding path program 1 times [2022-12-14 15:00:46,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:46,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360192369] [2022-12-14 15:00:46,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:46,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:46,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:46,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360192369] [2022-12-14 15:00:46,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360192369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:46,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:46,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:00:46,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507594992] [2022-12-14 15:00:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:46,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:00:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:46,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:00:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:00:46,706 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:46,805 INFO L93 Difference]: Finished difference Result 122 states and 172 transitions. [2022-12-14 15:00:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:00:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 15:00:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:46,807 INFO L225 Difference]: With dead ends: 122 [2022-12-14 15:00:46,807 INFO L226 Difference]: Without dead ends: 122 [2022-12-14 15:00:46,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:00:46,808 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 128 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:46,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 93 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-14 15:00:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-12-14 15:00:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 74 states have (on average 2.054054054054054) internal successors, (152), 109 states have internal predecessors, (152), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 15:00:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2022-12-14 15:00:46,815 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 8 [2022-12-14 15:00:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:46,815 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2022-12-14 15:00:46,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2022-12-14 15:00:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:00:46,816 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:46,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:46,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:00:46,816 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2056662893, now seen corresponding path program 1 times [2022-12-14 15:00:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:46,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883678804] [2022-12-14 15:00:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:46,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:46,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883678804] [2022-12-14 15:00:46,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883678804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:46,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:46,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:00:46,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624427472] [2022-12-14 15:00:46,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:46,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:00:46,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:46,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:00:46,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:00:46,895 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:46,975 INFO L93 Difference]: Finished difference Result 121 states and 171 transitions. [2022-12-14 15:00:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:00:46,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 15:00:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:46,977 INFO L225 Difference]: With dead ends: 121 [2022-12-14 15:00:46,977 INFO L226 Difference]: Without dead ends: 121 [2022-12-14 15:00:46,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:00:46,978 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:46,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 108 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-14 15:00:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-12-14 15:00:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 2.0405405405405403) internal successors, (151), 108 states have internal predecessors, (151), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 15:00:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2022-12-14 15:00:46,988 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 8 [2022-12-14 15:00:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:46,988 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2022-12-14 15:00:46,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2022-12-14 15:00:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:00:46,989 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:46,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:46,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:00:46,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2124365722, now seen corresponding path program 1 times [2022-12-14 15:00:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:46,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224641] [2022-12-14 15:00:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:47,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:47,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224641] [2022-12-14 15:00:47,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:47,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:47,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:00:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203341311] [2022-12-14 15:00:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:47,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:00:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:00:47,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:00:47,051 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:47,208 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2022-12-14 15:00:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:00:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 15:00:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:47,209 INFO L225 Difference]: With dead ends: 143 [2022-12-14 15:00:47,210 INFO L226 Difference]: Without dead ends: 143 [2022-12-14 15:00:47,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:00:47,210 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 320 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:47,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 132 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-14 15:00:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 116. [2022-12-14 15:00:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.8918918918918919) internal successors, (140), 103 states have internal predecessors, (140), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 15:00:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2022-12-14 15:00:47,219 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 11 [2022-12-14 15:00:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:47,219 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2022-12-14 15:00:47,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2022-12-14 15:00:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:00:47,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:47,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:47,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:00:47,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2124365723, now seen corresponding path program 1 times [2022-12-14 15:00:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:47,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579315008] [2022-12-14 15:00:47,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:47,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:47,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:47,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579315008] [2022-12-14 15:00:47,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579315008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:47,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:47,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:00:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504130983] [2022-12-14 15:00:47,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:47,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:00:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:00:47,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:00:47,328 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:47,487 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2022-12-14 15:00:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:00:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 15:00:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:47,489 INFO L225 Difference]: With dead ends: 139 [2022-12-14 15:00:47,489 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 15:00:47,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:00:47,490 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 253 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:47,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 157 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 15:00:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2022-12-14 15:00:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 103 states have internal predecessors, (134), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 15:00:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2022-12-14 15:00:47,497 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 11 [2022-12-14 15:00:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:47,497 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2022-12-14 15:00:47,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2022-12-14 15:00:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:00:47,498 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:47,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:47,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:00:47,498 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1159058315, now seen corresponding path program 1 times [2022-12-14 15:00:47,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:47,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219498738] [2022-12-14 15:00:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:47,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:47,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219498738] [2022-12-14 15:00:47,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219498738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:00:47,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604283200] [2022-12-14 15:00:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:47,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:00:47,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:00:47,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:00:47,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:00:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:47,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 15:00:47,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:00:47,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:00:47,683 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:00:47,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 15:00:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:00:47,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:00:47,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604283200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:47,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:00:47,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-12-14 15:00:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363670795] [2022-12-14 15:00:47,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:47,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:00:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:00:47,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:00:47,713 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:47,860 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2022-12-14 15:00:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:00:47,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:00:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:47,861 INFO L225 Difference]: With dead ends: 128 [2022-12-14 15:00:47,861 INFO L226 Difference]: Without dead ends: 128 [2022-12-14 15:00:47,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:00:47,862 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:47,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 137 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-14 15:00:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2022-12-14 15:00:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.7777777777777777) internal successors, (144), 109 states have internal predecessors, (144), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 15:00:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 166 transitions. [2022-12-14 15:00:47,866 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 166 transitions. Word has length 13 [2022-12-14 15:00:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:47,866 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 166 transitions. [2022-12-14 15:00:47,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 166 transitions. [2022-12-14 15:00:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:00:47,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:47,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:47,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:00:48,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 15:00:48,068 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:48,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1159058314, now seen corresponding path program 1 times [2022-12-14 15:00:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:48,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987090758] [2022-12-14 15:00:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:48,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:48,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987090758] [2022-12-14 15:00:48,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987090758] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:00:48,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977151440] [2022-12-14 15:00:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:48,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:00:48,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:00:48,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:00:48,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:00:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:48,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 15:00:48,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:00:48,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:00:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:48,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:00:48,588 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 41 treesize of output 37 [2022-12-14 15:00:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:48,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977151440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:00:48,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [132029314] [2022-12-14 15:00:48,629 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 15:00:48,629 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:00:48,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:00:48,636 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:00:48,637 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:00:48,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:00:48,685 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 [2022-12-14 15:00:48,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:48,701 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 [2022-12-14 15:00:48,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:00:48,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:00:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:00:48,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:00:48,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:48,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:00:48,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:00:48,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:00:48,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:00:48,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:00:48,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:48,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:00:48,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:48,997 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 21 [2022-12-14 15:00:49,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:49,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:00:49,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2022-12-14 15:00:49,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:49,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:49,156 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:00:49,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 133 [2022-12-14 15:00:49,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2022-12-14 15:00:49,238 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 13 treesize of output 9 [2022-12-14 15:00:49,243 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 13 treesize of output 9 [2022-12-14 15:00:49,249 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 19 treesize of output 1 [2022-12-14 15:00:49,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:49,277 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:00:49,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:00:49,306 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 19 treesize of output 1 [2022-12-14 15:00:49,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:49,322 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:00:49,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:00:49,376 INFO L321 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-12-14 15:00:49,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 33 treesize of output 66 [2022-12-14 15:00:49,435 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:00:49,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:00:49,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:00:49,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:49,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:49,509 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:00:49,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 197 [2022-12-14 15:00:49,528 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 15:00:49,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 194 [2022-12-14 15:00:49,568 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 13 treesize of output 9 [2022-12-14 15:00:49,574 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 19 treesize of output 1 [2022-12-14 15:00:49,584 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 13 treesize of output 9 [2022-12-14 15:00:49,598 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 19 treesize of output 1 [2022-12-14 15:00:49,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:49,611 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:00:49,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:00:49,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:49,647 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:00:49,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:00:49,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:00:49,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 15:00:49,697 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 15 for LOIs [2022-12-14 15:00:49,703 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:00:50,159 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2733#(and (<= |is_list_containing_x_#in~x.offset| 0) (<= 0 |is_list_containing_x_#in~x.offset|) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset) (= |#NULL.offset| 0) (= |is_list_containing_x_#in~l.offset| 0) (not (<= (+ is_list_containing_x_~l.offset 8) (select |#length| is_list_containing_x_~l.base))) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (<= 0 |#StackHeapBarrier|) (<= 0 |is_list_containing_x_#in~l.base|) (= |#NULL.base| 0) (not (= is_list_containing_x_~l.base is_list_containing_x_~x.base)))' at error location [2022-12-14 15:00:50,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:00:50,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:00:50,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-14 15:00:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921098614] [2022-12-14 15:00:50,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:00:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:00:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:00:50,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:00:50,161 INFO L87 Difference]: Start difference. First operand 124 states and 166 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:50,383 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-12-14 15:00:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:00:50,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:00:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:50,385 INFO L225 Difference]: With dead ends: 125 [2022-12-14 15:00:50,385 INFO L226 Difference]: Without dead ends: 125 [2022-12-14 15:00:50,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:00:50,386 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 307 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:50,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 269 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:00:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-14 15:00:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-12-14 15:00:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.7407407407407407) internal successors, (141), 108 states have internal predecessors, (141), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 15:00:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2022-12-14 15:00:50,390 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 13 [2022-12-14 15:00:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:50,391 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2022-12-14 15:00:50,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2022-12-14 15:00:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:00:50,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:50,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:50,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:00:50,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:00:50,593 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1754391202, now seen corresponding path program 1 times [2022-12-14 15:00:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:50,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115131448] [2022-12-14 15:00:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:50,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:50,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115131448] [2022-12-14 15:00:50,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115131448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:50,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:50,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:00:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241799839] [2022-12-14 15:00:50,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:50,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:00:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:50,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:00:50,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:00:50,732 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:50,900 INFO L93 Difference]: Finished difference Result 155 states and 196 transitions. [2022-12-14 15:00:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:00:50,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-14 15:00:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:50,901 INFO L225 Difference]: With dead ends: 155 [2022-12-14 15:00:50,901 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 15:00:50,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:00:50,902 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 78 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:50,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 335 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 15:00:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 120. [2022-12-14 15:00:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 105 states have internal predecessors, (135), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 15:00:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2022-12-14 15:00:50,905 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 15 [2022-12-14 15:00:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:50,905 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2022-12-14 15:00:50,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2022-12-14 15:00:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:00:50,906 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:50,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:50,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 15:00:50,906 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2030371260, now seen corresponding path program 1 times [2022-12-14 15:00:50,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:50,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74750457] [2022-12-14 15:00:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:50,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:50,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74750457] [2022-12-14 15:00:50,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74750457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:00:50,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020870145] [2022-12-14 15:00:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:50,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:00:50,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:00:50,998 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:00:50,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:00:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:51,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 15:00:51,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:00:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:51,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:00:51,190 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 15:00:51,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 15:00:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:51,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020870145] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:00:51,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1525063547] [2022-12-14 15:00:51,198 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:00:51,199 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:00:51,199 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:00:51,199 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:00:51,199 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:00:51,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:00:51,225 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 [2022-12-14 15:00:51,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:51,237 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 [2022-12-14 15:00:51,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:00:51,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:00:51,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:00:51,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:00:51,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:51,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:00:51,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:00:51,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:00:51,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:00:51,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:00:51,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:51,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:00:51,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,481 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 21 [2022-12-14 15:00:51,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:51,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:00:51,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2022-12-14 15:00:51,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:51,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:51,619 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:00:51,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 133 [2022-12-14 15:00:51,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2022-12-14 15:00:51,675 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 19 treesize of output 1 [2022-12-14 15:00:51,679 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 13 treesize of output 9 [2022-12-14 15:00:51,684 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 13 treesize of output 9 [2022-12-14 15:00:51,716 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 19 treesize of output 1 [2022-12-14 15:00:51,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:51,732 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:00:51,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:00:51,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:51,747 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:00:51,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:00:51,786 INFO L321 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-12-14 15:00:51,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 33 treesize of output 66 [2022-12-14 15:00:51,835 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:00:51,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:00:51,885 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 15:00:51,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 147 [2022-12-14 15:00:51,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:51,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:51,901 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:00:51,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 168 [2022-12-14 15:00:51,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:00:51,939 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 13 treesize of output 9 [2022-12-14 15:00:51,944 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 19 treesize of output 1 [2022-12-14 15:00:51,952 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 13 treesize of output 9 [2022-12-14 15:00:51,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:51,981 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:00:51,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:00:52,001 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 19 treesize of output 1 [2022-12-14 15:00:52,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:52,016 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:00:52,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:00:52,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:00:52,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 15:00:52,112 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 15 for LOIs [2022-12-14 15:00:52,117 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:00:52,741 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3385#(and (= (mod (+ (* 255 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) 1) 256) 0) (<= 0 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= 0 |ULTIMATE.start_main_~tail~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (< |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 256) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_remove_~x#1.offset|) (not (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1)) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2022-12-14 15:00:52,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:00:52,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:00:52,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2022-12-14 15:00:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368323962] [2022-12-14 15:00:52,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:00:52,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:00:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:00:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:00:52,743 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 15:00:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:53,106 INFO L93 Difference]: Finished difference Result 187 states and 241 transitions. [2022-12-14 15:00:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:00:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 16 [2022-12-14 15:00:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:53,108 INFO L225 Difference]: With dead ends: 187 [2022-12-14 15:00:53,108 INFO L226 Difference]: Without dead ends: 187 [2022-12-14 15:00:53,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2022-12-14 15:00:53,109 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 477 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:53,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 188 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:00:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-12-14 15:00:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 158. [2022-12-14 15:00:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.7818181818181817) internal successors, (196), 138 states have internal predecessors, (196), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2022-12-14 15:00:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 231 transitions. [2022-12-14 15:00:53,113 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 231 transitions. Word has length 16 [2022-12-14 15:00:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:53,114 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 231 transitions. [2022-12-14 15:00:53,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 15:00:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 231 transitions. [2022-12-14 15:00:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:00:53,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:53,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:53,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 15:00:53,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 15:00:53,316 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2030371261, now seen corresponding path program 1 times [2022-12-14 15:00:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:53,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523197942] [2022-12-14 15:00:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:53,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:53,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:53,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523197942] [2022-12-14 15:00:53,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523197942] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:00:53,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455533816] [2022-12-14 15:00:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:53,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:00:53,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:00:53,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:00:53,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:00:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:53,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 15:00:53,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:00:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:53,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:00:53,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:00:53,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-12-14 15:00:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455533816] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:00:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1801202745] [2022-12-14 15:00:53,856 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:00:53,856 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:00:53,856 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:00:53,856 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:00:53,856 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:00:53,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:00:53,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:53,886 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 [2022-12-14 15:00:53,891 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 [2022-12-14 15:00:53,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:00:53,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:00:53,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:00:53,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:00:53,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:00:53,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:00:53,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:53,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:54,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:00:54,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:00:54,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:00:54,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,093 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 21 [2022-12-14 15:00:54,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:54,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:00:54,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:54,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:00:54,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2022-12-14 15:00:54,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:54,235 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:00:54,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 133 [2022-12-14 15:00:54,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2022-12-14 15:00:54,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:00:54,291 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 13 treesize of output 9 [2022-12-14 15:00:54,295 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 13 treesize of output 9 [2022-12-14 15:00:54,299 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 19 treesize of output 1 [2022-12-14 15:00:54,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:54,327 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:00:54,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:00:54,333 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 19 treesize of output 1 [2022-12-14 15:00:54,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:54,345 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:00:54,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:00:54,381 INFO L321 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-12-14 15:00:54,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 33 treesize of output 66 [2022-12-14 15:00:54,435 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:00:54,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:00:54,459 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 15:00:54,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 147 [2022-12-14 15:00:54,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:54,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:54,471 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:00:54,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 141 [2022-12-14 15:00:54,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:00:54,498 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 13 treesize of output 9 [2022-12-14 15:00:54,501 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 13 treesize of output 9 [2022-12-14 15:00:54,506 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 19 treesize of output 1 [2022-12-14 15:00:54,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:54,531 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:00:54,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:00:54,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:00:54,544 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:00:54,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:00:54,550 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 19 treesize of output 1 [2022-12-14 15:00:54,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 15:00:54,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:00:54,634 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 15 for LOIs [2022-12-14 15:00:54,638 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:00:55,281 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3867#(and (= (mod (+ (* 255 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) 1) 256) 0) (<= 0 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= 0 |ULTIMATE.start_main_~tail~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (< |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 256) (<= |#NULL.offset| 0) (not (<= (+ 8 |ULTIMATE.start_remove_~x#1.offset|) (select |#length| |ULTIMATE.start_remove_~x#1.base|))) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_remove_~x#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2022-12-14 15:00:55,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:00:55,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:00:55,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-14 15:00:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766436237] [2022-12-14 15:00:55,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:00:55,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 15:00:55,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 15:00:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2022-12-14 15:00:55,283 INFO L87 Difference]: Start difference. First operand 158 states and 231 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 15:00:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:55,855 INFO L93 Difference]: Finished difference Result 293 states and 413 transitions. [2022-12-14 15:00:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:00:55,855 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2022-12-14 15:00:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:55,857 INFO L225 Difference]: With dead ends: 293 [2022-12-14 15:00:55,857 INFO L226 Difference]: Without dead ends: 293 [2022-12-14 15:00:55,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=275, Invalid=1617, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 15:00:55,858 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 443 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:55,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 447 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:00:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-12-14 15:00:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 163. [2022-12-14 15:00:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 142 states have internal predecessors, (198), 16 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2022-12-14 15:00:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 236 transitions. [2022-12-14 15:00:55,865 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 236 transitions. Word has length 16 [2022-12-14 15:00:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:55,865 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 236 transitions. [2022-12-14 15:00:55,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 15:00:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 236 transitions. [2022-12-14 15:00:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:00:55,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:55,866 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:55,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:00:56,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 15:00:56,068 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash 472269758, now seen corresponding path program 1 times [2022-12-14 15:00:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:56,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094160957] [2022-12-14 15:00:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:56,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:00:56,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094160957] [2022-12-14 15:00:56,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094160957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:56,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:56,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:00:56,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949704502] [2022-12-14 15:00:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:56,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:00:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:56,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:00:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:56,131 INFO L87 Difference]: Start difference. First operand 163 states and 236 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:56,157 INFO L93 Difference]: Finished difference Result 174 states and 225 transitions. [2022-12-14 15:00:56,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:00:56,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-14 15:00:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:56,159 INFO L225 Difference]: With dead ends: 174 [2022-12-14 15:00:56,159 INFO L226 Difference]: Without dead ends: 174 [2022-12-14 15:00:56,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:00:56,160 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 56 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:56,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 194 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:00:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-12-14 15:00:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2022-12-14 15:00:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 135 states have internal predecessors, (185), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2022-12-14 15:00:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 220 transitions. [2022-12-14 15:00:56,164 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 220 transitions. Word has length 17 [2022-12-14 15:00:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:56,164 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 220 transitions. [2022-12-14 15:00:56,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 220 transitions. [2022-12-14 15:00:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:00:56,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:56,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:56,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 15:00:56,165 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:56,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1986748576, now seen corresponding path program 1 times [2022-12-14 15:00:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:56,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065942111] [2022-12-14 15:00:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:56,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:56,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065942111] [2022-12-14 15:00:56,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065942111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:00:56,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:00:56,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:00:56,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153836752] [2022-12-14 15:00:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:00:56,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:00:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:56,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:00:56,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:00:56,310 INFO L87 Difference]: Start difference. First operand 155 states and 220 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:56,434 INFO L93 Difference]: Finished difference Result 176 states and 234 transitions. [2022-12-14 15:00:56,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:00:56,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-14 15:00:56,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:56,436 INFO L225 Difference]: With dead ends: 176 [2022-12-14 15:00:56,436 INFO L226 Difference]: Without dead ends: 176 [2022-12-14 15:00:56,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:00:56,436 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 131 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:56,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 323 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:00:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-12-14 15:00:56,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 152. [2022-12-14 15:00:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 107 states have (on average 1.6728971962616823) internal successors, (179), 132 states have internal predecessors, (179), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2022-12-14 15:00:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 214 transitions. [2022-12-14 15:00:56,440 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 214 transitions. Word has length 17 [2022-12-14 15:00:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:56,440 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 214 transitions. [2022-12-14 15:00:56,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:00:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 214 transitions. [2022-12-14 15:00:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:00:56,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:56,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:56,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 15:00:56,441 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash -158970448, now seen corresponding path program 1 times [2022-12-14 15:00:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:56,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087322946] [2022-12-14 15:00:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:56,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:56,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087322946] [2022-12-14 15:00:56,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087322946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:00:56,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832556236] [2022-12-14 15:00:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:56,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:00:56,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:00:56,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:00:56,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:00:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:56,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 15:00:56,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:00:56,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:00:56,714 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 13 treesize of output 9 [2022-12-14 15:00:56,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 9 [2022-12-14 15:00:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:56,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:00:56,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 28 [2022-12-14 15:00:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:56,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832556236] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:00:56,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [175671791] [2022-12-14 15:00:56,812 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:00:56,813 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:00:56,813 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:00:56,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:00:56,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-14 15:00:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615888805] [2022-12-14 15:00:56,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:00:56,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:00:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:56,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:00:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:00:56,816 INFO L87 Difference]: Start difference. First operand 152 states and 214 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:00:57,258 INFO L93 Difference]: Finished difference Result 258 states and 350 transitions. [2022-12-14 15:00:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:00:57,258 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:00:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:00:57,260 INFO L225 Difference]: With dead ends: 258 [2022-12-14 15:00:57,260 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 15:00:57,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:00:57,261 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 329 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:00:57,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 669 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:00:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 15:00:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 175. [2022-12-14 15:00:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 123 states have (on average 1.5934959349593496) internal successors, (196), 149 states have internal predecessors, (196), 20 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (25), 18 states have call predecessors, (25), 20 states have call successors, (25) [2022-12-14 15:00:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 241 transitions. [2022-12-14 15:00:57,270 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 241 transitions. Word has length 19 [2022-12-14 15:00:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:00:57,270 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 241 transitions. [2022-12-14 15:00:57,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:00:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 241 transitions. [2022-12-14 15:00:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:00:57,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:00:57,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:00:57,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 15:00:57,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 15:00:57,473 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:00:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:00:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash -158970447, now seen corresponding path program 1 times [2022-12-14 15:00:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:00:57,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306688284] [2022-12-14 15:00:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:00:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:57,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:00:57,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306688284] [2022-12-14 15:00:57,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306688284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:00:57,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182133470] [2022-12-14 15:00:57,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:00:57,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:00:57,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:00:57,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:00:57,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:00:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:00:58,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 15:00:58,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:00:58,181 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 13 treesize of output 9 [2022-12-14 15:00:58,185 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 13 treesize of output 9 [2022-12-14 15:00:58,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2022-12-14 15:00:58,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-12-14 15:00:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:58,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:00:58,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 28 [2022-12-14 15:00:58,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:58,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:58,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:58,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:00:58,602 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 8 treesize of output 6 [2022-12-14 15:00:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:00:58,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182133470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:00:58,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [353950983] [2022-12-14 15:00:58,670 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:00:58,670 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:00:58,670 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:00:58,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:00:58,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 33 [2022-12-14 15:00:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771648185] [2022-12-14 15:00:58,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:00:58,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 15:00:58,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:00:58,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 15:00:58,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 15:00:58,673 INFO L87 Difference]: Start difference. First operand 175 states and 241 transitions. Second operand has 33 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 27 states have internal predecessors, (49), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:01:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:01:00,509 INFO L93 Difference]: Finished difference Result 324 states and 412 transitions. [2022-12-14 15:01:00,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 15:01:00,510 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 27 states have internal predecessors, (49), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:01:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:01:00,511 INFO L225 Difference]: With dead ends: 324 [2022-12-14 15:01:00,511 INFO L226 Difference]: Without dead ends: 324 [2022-12-14 15:01:00,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 15:01:00,512 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1030 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:01:00,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1297 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 15:01:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-12-14 15:01:00,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 239. [2022-12-14 15:01:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 174 states have (on average 1.5632183908045978) internal successors, (272), 202 states have internal predecessors, (272), 29 states have call successors, (29), 10 states have call predecessors, (29), 12 states have return successors, (39), 26 states have call predecessors, (39), 29 states have call successors, (39) [2022-12-14 15:01:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 340 transitions. [2022-12-14 15:01:00,519 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 340 transitions. Word has length 19 [2022-12-14 15:01:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:01:00,519 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 340 transitions. [2022-12-14 15:01:00,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 27 states have internal predecessors, (49), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:01:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 340 transitions. [2022-12-14 15:01:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:01:00,520 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:01:00,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:01:00,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:01:00,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 15:01:00,722 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:01:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:01:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1801700008, now seen corresponding path program 1 times [2022-12-14 15:01:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:01:00,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210891892] [2022-12-14 15:01:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:01:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:00,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:01:00,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210891892] [2022-12-14 15:01:00,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210891892] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:01:00,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901945911] [2022-12-14 15:01:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:00,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:00,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:01:00,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:01:00,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:01:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:00,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 15:01:00,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:01:00,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:01:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:01,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:01:01,297 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 14 treesize of output 12 [2022-12-14 15:01:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:01,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901945911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:01:01,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790428624] [2022-12-14 15:01:01,299 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-12-14 15:01:01,299 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:01:01,300 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:01:01,300 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:01:01,300 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:01:01,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:01:01,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:01,329 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 [2022-12-14 15:01:01,333 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 [2022-12-14 15:01:01,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:01:01,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:01:01,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:01:01,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:01:01,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:01:01,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:01,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:01:01,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:01:01,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:01:01,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:01:01,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:01,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:01:01,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:01,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:01:01,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,492 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 21 [2022-12-14 15:01:01,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2022-12-14 15:01:01,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:01,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:01,581 INFO L321 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-12-14 15:01:01,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 180 [2022-12-14 15:01:01,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,598 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:01:01,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 132 [2022-12-14 15:01:01,620 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 13 treesize of output 9 [2022-12-14 15:01:01,623 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 13 treesize of output 9 [2022-12-14 15:01:01,626 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 19 treesize of output 1 [2022-12-14 15:01:01,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:01,642 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:01:01,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:01:01,646 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 19 treesize of output 1 [2022-12-14 15:01:01,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:01,657 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:01:01,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:01:01,702 INFO L321 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-12-14 15:01:01,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 33 treesize of output 66 [2022-12-14 15:01:01,740 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:01:01,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:01:01,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:01:01,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:01,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:01,766 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:01:01,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 120 [2022-12-14 15:01:01,776 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 15:01:01,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 138 [2022-12-14 15:01:01,789 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 13 treesize of output 9 [2022-12-14 15:01:01,792 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 13 treesize of output 9 [2022-12-14 15:01:01,795 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 19 treesize of output 1 [2022-12-14 15:01:01,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:01,809 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:01:01,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:01:01,813 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 19 treesize of output 1 [2022-12-14 15:01:01,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:01,823 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:01:01,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:01:01,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 15:01:01,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:01:01,902 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 12 for LOIs [2022-12-14 15:01:01,911 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:01:02,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1790428624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:01:02,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:01:02,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8, 9, 8] total 31 [2022-12-14 15:01:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074365007] [2022-12-14 15:01:02,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:01:02,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:01:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:01:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:01:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-12-14 15:01:02,406 INFO L87 Difference]: Start difference. First operand 239 states and 340 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:01:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:01:03,079 INFO L93 Difference]: Finished difference Result 281 states and 380 transitions. [2022-12-14 15:01:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:01:03,079 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-12-14 15:01:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:01:03,081 INFO L225 Difference]: With dead ends: 281 [2022-12-14 15:01:03,081 INFO L226 Difference]: Without dead ends: 279 [2022-12-14 15:01:03,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 15:01:03,082 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 200 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:01:03,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 272 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:01:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-12-14 15:01:03,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 243. [2022-12-14 15:01:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 206 states have internal predecessors, (274), 29 states have call successors, (29), 10 states have call predecessors, (29), 14 states have return successors, (43), 26 states have call predecessors, (43), 29 states have call successors, (43) [2022-12-14 15:01:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 346 transitions. [2022-12-14 15:01:03,090 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 346 transitions. Word has length 18 [2022-12-14 15:01:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:01:03,090 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 346 transitions. [2022-12-14 15:01:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:01:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 346 transitions. [2022-12-14 15:01:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:01:03,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:01:03,091 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] [2022-12-14 15:01:03,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 15:01:03,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:03,292 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:01:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:01:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash -130356238, now seen corresponding path program 1 times [2022-12-14 15:01:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:01:03,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498466850] [2022-12-14 15:01:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:03,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:01:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:03,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:01:03,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498466850] [2022-12-14 15:01:03,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498466850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:01:03,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:01:03,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:01:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35029372] [2022-12-14 15:01:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:01:03,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:01:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:01:03,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:01:03,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:01:03,333 INFO L87 Difference]: Start difference. First operand 243 states and 346 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:01:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:01:03,372 INFO L93 Difference]: Finished difference Result 259 states and 367 transitions. [2022-12-14 15:01:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:01:03,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-12-14 15:01:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:01:03,375 INFO L225 Difference]: With dead ends: 259 [2022-12-14 15:01:03,375 INFO L226 Difference]: Without dead ends: 259 [2022-12-14 15:01:03,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:01:03,376 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 6 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:01:03,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 298 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:01:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-12-14 15:01:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2022-12-14 15:01:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 179 states have (on average 1.547486033519553) internal successors, (277), 215 states have internal predecessors, (277), 35 states have call successors, (35), 11 states have call predecessors, (35), 15 states have return successors, (49), 26 states have call predecessors, (49), 35 states have call successors, (49) [2022-12-14 15:01:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 361 transitions. [2022-12-14 15:01:03,388 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 361 transitions. Word has length 20 [2022-12-14 15:01:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:01:03,388 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 361 transitions. [2022-12-14 15:01:03,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:01:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 361 transitions. [2022-12-14 15:01:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:01:03,389 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:01:03,389 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] [2022-12-14 15:01:03,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 15:01:03,390 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:01:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:01:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2029912448, now seen corresponding path program 1 times [2022-12-14 15:01:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:01:03,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118745299] [2022-12-14 15:01:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:01:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:03,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:01:03,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118745299] [2022-12-14 15:01:03,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118745299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:01:03,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468533685] [2022-12-14 15:01:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:01:03,611 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:01:03,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:01:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:03,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 15:01:03,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:01:03,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:01:03,751 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 13 treesize of output 9 [2022-12-14 15:01:03,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:01:03,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-12-14 15:01:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:03,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:01:04,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468533685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:01:04,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [921335233] [2022-12-14 15:01:04,157 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 15:01:04,157 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:01:04,157 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:01:04,157 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:01:04,157 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:01:04,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:01:04,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:04,186 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 [2022-12-14 15:01:04,191 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 [2022-12-14 15:01:04,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:01:04,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:01:04,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:01:04,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:01:04,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:01:04,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:01:04,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:04,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:01:04,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:01:04,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:01:04,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,341 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 21 [2022-12-14 15:01:04,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:04,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:01:04,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:04,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:01:04,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2022-12-14 15:01:04,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:04,457 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:01:04,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 133 [2022-12-14 15:01:04,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2022-12-14 15:01:04,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:04,516 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 13 treesize of output 9 [2022-12-14 15:01:04,520 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 13 treesize of output 9 [2022-12-14 15:01:04,525 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 19 treesize of output 1 [2022-12-14 15:01:04,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:04,579 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:01:04,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:01:04,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:04,594 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:01:04,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:01:04,600 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 19 treesize of output 1 [2022-12-14 15:01:04,639 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:01:04,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:01:04,655 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-14 15:01:04,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2022-12-14 15:01:04,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:01:04,692 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 15:01:04,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 147 [2022-12-14 15:01:04,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:04,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:04,707 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:01:04,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 156 [2022-12-14 15:01:04,729 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 19 treesize of output 1 [2022-12-14 15:01:04,734 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 13 treesize of output 9 [2022-12-14 15:01:04,739 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 13 treesize of output 9 [2022-12-14 15:01:04,754 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 19 treesize of output 1 [2022-12-14 15:01:04,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:04,768 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:01:04,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:01:04,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:04,793 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:01:04,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:01:04,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 15:01:04,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:01:04,911 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 15 for LOIs [2022-12-14 15:01:04,916 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:01:06,328 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7632#(and (= (mod (+ (* 255 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) 1) 256) 0) (<= 0 |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (<= (+ 8 |ULTIMATE.start_remove_~x#1.offset|) (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (<= 0 |ULTIMATE.start_main_~tail~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (< |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 256) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) |ULTIMATE.start_remove_#t~mem4#1.offset|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) |ULTIMATE.start_remove_#t~mem5#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= 0 |ULTIMATE.start_remove_~x#1.offset|) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_remove_~x#1.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0))) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (not (= (select |#valid| |ULTIMATE.start_remove_#t~mem4#1.base|) 1)) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2022-12-14 15:01:06,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:01:06,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:01:06,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-12-14 15:01:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643296108] [2022-12-14 15:01:06,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:01:06,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 15:01:06,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:01:06,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 15:01:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 15:01:06,330 INFO L87 Difference]: Start difference. First operand 253 states and 361 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:01:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:01:07,719 INFO L93 Difference]: Finished difference Result 380 states and 490 transitions. [2022-12-14 15:01:07,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:01:07,719 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-12-14 15:01:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:01:07,721 INFO L225 Difference]: With dead ends: 380 [2022-12-14 15:01:07,721 INFO L226 Difference]: Without dead ends: 380 [2022-12-14 15:01:07,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=227, Invalid=1935, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 15:01:07,722 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 701 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:01:07,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 909 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:01:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-12-14 15:01:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 272. [2022-12-14 15:01:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 193 states have (on average 1.538860103626943) internal successors, (297), 229 states have internal predecessors, (297), 37 states have call successors, (37), 14 states have call predecessors, (37), 18 states have return successors, (51), 28 states have call predecessors, (51), 37 states have call successors, (51) [2022-12-14 15:01:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 385 transitions. [2022-12-14 15:01:07,729 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 385 transitions. Word has length 20 [2022-12-14 15:01:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:01:07,729 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 385 transitions. [2022-12-14 15:01:07,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:01:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 385 transitions. [2022-12-14 15:01:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:01:07,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:01:07,730 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] [2022-12-14 15:01:07,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 15:01:07,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:07,932 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:01:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:01:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2029912447, now seen corresponding path program 1 times [2022-12-14 15:01:07,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:01:07,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399333109] [2022-12-14 15:01:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:07,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:01:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:08,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:01:08,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399333109] [2022-12-14 15:01:08,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399333109] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:01:08,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129912375] [2022-12-14 15:01:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:08,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:08,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:01:08,487 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:01:08,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 15:01:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:08,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-14 15:01:08,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:01:08,641 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 13 treesize of output 9 [2022-12-14 15:01:08,644 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 13 treesize of output 9 [2022-12-14 15:01:08,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 9 [2022-12-14 15:01:08,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-12-14 15:01:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:08,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:01:09,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 64 [2022-12-14 15:01:09,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 94 treesize of output 82 [2022-12-14 15:01:09,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,215 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 8 treesize of output 6 [2022-12-14 15:01:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:09,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129912375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:01:09,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [74826503] [2022-12-14 15:01:09,250 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 15:01:09,250 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:01:09,250 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:01:09,250 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:01:09,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:01:09,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:01:09,277 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 [2022-12-14 15:01:09,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:09,288 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 [2022-12-14 15:01:09,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:01:09,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:01:09,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:01:09,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:01:09,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:09,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:01:09,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:01:09,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:01:09,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:01:09,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:01:09,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:01:09,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:01:09,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,492 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 21 [2022-12-14 15:01:09,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2022-12-14 15:01:09,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:09,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,597 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:01:09,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 132 [2022-12-14 15:01:09,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:09,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,616 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:01:09,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 133 [2022-12-14 15:01:09,646 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 19 treesize of output 1 [2022-12-14 15:01:09,649 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 13 treesize of output 9 [2022-12-14 15:01:09,653 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 13 treesize of output 9 [2022-12-14 15:01:09,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,683 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:01:09,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:01:09,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,698 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:01:09,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:01:09,705 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 19 treesize of output 1 [2022-12-14 15:01:09,746 INFO L321 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-12-14 15:01:09,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 58 [2022-12-14 15:01:09,783 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:01:09,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:01:09,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,810 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:01:09,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 89 [2022-12-14 15:01:09,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,831 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-14 15:01:09,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:01:09,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:01:09,848 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 19 treesize of output 1 [2022-12-14 15:01:09,851 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 13 treesize of output 9 [2022-12-14 15:01:09,853 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 13 treesize of output 9 [2022-12-14 15:01:09,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,875 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:01:09,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:01:09,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:09,888 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:01:09,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:01:09,893 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 19 treesize of output 1 [2022-12-14 15:01:09,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:01:09,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 15:01:10,001 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 15 for LOIs [2022-12-14 15:01:10,005 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:01:11,671 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8461#(and (= (mod (+ (* 255 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) 1) 256) 0) (<= 0 |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (<= (+ 8 |ULTIMATE.start_remove_~x#1.offset|) (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (<= 0 |ULTIMATE.start_main_~tail~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (< |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 256) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) |ULTIMATE.start_remove_#t~mem4#1.offset|) (or (not (<= 0 |ULTIMATE.start_remove_#t~mem4#1.offset|)) (not (<= (+ |ULTIMATE.start_remove_#t~mem4#1.offset| 4) (select |#length| |ULTIMATE.start_remove_#t~mem4#1.base|)))) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) |ULTIMATE.start_remove_#t~mem5#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= 0 |ULTIMATE.start_remove_~x#1.offset|) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_remove_~x#1.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0))) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2022-12-14 15:01:11,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:01:11,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:01:11,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 32 [2022-12-14 15:01:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3012555] [2022-12-14 15:01:11,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:01:11,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 15:01:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:01:11,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 15:01:11,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2183, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 15:01:11,673 INFO L87 Difference]: Start difference. First operand 272 states and 385 transitions. Second operand has 33 states, 32 states have (on average 1.59375) internal successors, (51), 29 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 15:01:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:01:15,315 INFO L93 Difference]: Finished difference Result 509 states and 641 transitions. [2022-12-14 15:01:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 15:01:15,315 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.59375) internal successors, (51), 29 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-12-14 15:01:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:01:15,319 INFO L225 Difference]: With dead ends: 509 [2022-12-14 15:01:15,319 INFO L226 Difference]: Without dead ends: 509 [2022-12-14 15:01:15,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=611, Invalid=4791, Unknown=0, NotChecked=0, Total=5402 [2022-12-14 15:01:15,322 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1166 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 2738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:01:15,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 933 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 2738 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 15:01:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-12-14 15:01:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 334. [2022-12-14 15:01:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 239 states have (on average 1.5271966527196652) internal successors, (365), 278 states have internal predecessors, (365), 47 states have call successors, (47), 19 states have call predecessors, (47), 24 states have return successors, (64), 36 states have call predecessors, (64), 47 states have call successors, (64) [2022-12-14 15:01:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 476 transitions. [2022-12-14 15:01:15,335 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 476 transitions. Word has length 20 [2022-12-14 15:01:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:01:15,335 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 476 transitions. [2022-12-14 15:01:15,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.59375) internal successors, (51), 29 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 15:01:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 476 transitions. [2022-12-14 15:01:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:01:15,336 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:01:15,336 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, 1, 1] [2022-12-14 15:01:15,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 15:01:15,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:15,537 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:01:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:01:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash -474693630, now seen corresponding path program 1 times [2022-12-14 15:01:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:01:15,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906337547] [2022-12-14 15:01:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:01:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:15,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:01:15,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906337547] [2022-12-14 15:01:15,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906337547] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:01:15,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954804326] [2022-12-14 15:01:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:15,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:15,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:01:15,890 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:01:15,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 15:01:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:15,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 15:01:15,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:01:16,037 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 13 treesize of output 9 [2022-12-14 15:01:16,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:01:16,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2022-12-14 15:01:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:16,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:01:16,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954804326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:01:16,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404312061] [2022-12-14 15:01:16,440 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-12-14 15:01:16,441 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:01:16,441 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:01:16,441 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:01:16,441 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:01:16,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:01:16,464 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 [2022-12-14 15:01:16,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:16,477 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 [2022-12-14 15:01:16,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:01:16,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:01:16,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:01:16,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:01:16,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:16,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:01:16,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:01:16,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:01:16,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:01:16,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:01:16,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:16,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:01:16,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,658 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 21 [2022-12-14 15:01:16,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:16,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:01:16,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2022-12-14 15:01:16,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:01:16,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,767 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:01:16,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 119 [2022-12-14 15:01:16,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:01:16,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:16,799 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:01:16,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 133 [2022-12-14 15:01:16,834 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 13 treesize of output 9 [2022-12-14 15:01:16,838 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 13 treesize of output 9 [2022-12-14 15:01:16,842 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 19 treesize of output 1 [2022-12-14 15:01:16,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:16,863 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:01:16,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:01:16,876 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 19 treesize of output 1 [2022-12-14 15:01:16,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:16,890 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:01:16,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:01:16,931 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:01:16,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:01:16,943 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-14 15:01:16,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2022-12-14 15:01:16,964 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 15:01:16,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 100 [2022-12-14 15:01:16,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:16,976 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:01:16,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 70 [2022-12-14 15:01:16,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:01:17,001 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 19 treesize of output 1 [2022-12-14 15:01:17,005 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 13 treesize of output 9 [2022-12-14 15:01:17,009 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 13 treesize of output 9 [2022-12-14 15:01:17,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:17,027 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:01:17,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:01:17,039 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 19 treesize of output 1 [2022-12-14 15:01:17,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:01:17,054 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:01:17,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:01:17,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 15:01:17,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:01:17,221 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 15 for LOIs [2022-12-14 15:01:17,226 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:01:23,436 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9486#(and (not (= (select |#valid| |ULTIMATE.start_remove_#t~mem7#1.base|) 1)) (= (mod (+ (* 255 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) 1) 256) 0) (<= 0 |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ 8 |ULTIMATE.start_remove_~x#1.offset|) (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (<= 0 |ULTIMATE.start_main_~tail~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) |ULTIMATE.start_remove_#t~mem8#1.offset|) (< |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 256) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= 0 |ULTIMATE.start_remove_~x#1.offset|) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) |ULTIMATE.start_remove_#t~mem7#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_remove_~x#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (= |ULTIMATE.start_remove_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (= |ULTIMATE.start_remove_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2022-12-14 15:01:23,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:01:23,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:01:23,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-12-14 15:01:23,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793778408] [2022-12-14 15:01:23,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:01:23,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 15:01:23,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:01:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 15:01:23,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1729, Unknown=2, NotChecked=0, Total=1892 [2022-12-14 15:01:23,438 INFO L87 Difference]: Start difference. First operand 334 states and 476 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 19 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:01:25,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:27,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:29,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:31,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:33,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:35,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:38,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:40,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:42,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:44,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:46,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:48,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:51,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:53,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:55,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:57,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:01:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:01:57,363 INFO L93 Difference]: Finished difference Result 412 states and 527 transitions. [2022-12-14 15:01:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 15:01:57,363 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 19 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-12-14 15:01:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:01:57,364 INFO L225 Difference]: With dead ends: 412 [2022-12-14 15:01:57,364 INFO L226 Difference]: Without dead ends: 410 [2022-12-14 15:01:57,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=378, Invalid=3160, Unknown=2, NotChecked=0, Total=3540 [2022-12-14 15:01:57,366 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 509 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 108 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:01:57,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1467 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1729 Invalid, 16 Unknown, 0 Unchecked, 33.2s Time] [2022-12-14 15:01:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-12-14 15:01:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 319. [2022-12-14 15:01:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 264 states have internal predecessors, (348), 43 states have call successors, (43), 19 states have call predecessors, (43), 24 states have return successors, (58), 35 states have call predecessors, (58), 43 states have call successors, (58) [2022-12-14 15:01:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 449 transitions. [2022-12-14 15:01:57,378 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 449 transitions. Word has length 22 [2022-12-14 15:01:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:01:57,379 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 449 transitions. [2022-12-14 15:01:57,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 19 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:01:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 449 transitions. [2022-12-14 15:01:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 15:01:57,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:01:57,380 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, 1, 1, 1] [2022-12-14 15:01:57,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 15:01:57,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:57,580 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:01:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:01:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -787313730, now seen corresponding path program 1 times [2022-12-14 15:01:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:01:57,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722923893] [2022-12-14 15:01:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:01:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:57,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:01:57,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722923893] [2022-12-14 15:01:57,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722923893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:01:57,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:01:57,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:01:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914745134] [2022-12-14 15:01:57,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:01:57,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:01:57,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:01:57,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:01:57,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:01:57,624 INFO L87 Difference]: Start difference. First operand 319 states and 449 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:01:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:01:57,768 INFO L93 Difference]: Finished difference Result 326 states and 439 transitions. [2022-12-14 15:01:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:01:57,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-12-14 15:01:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:01:57,770 INFO L225 Difference]: With dead ends: 326 [2022-12-14 15:01:57,770 INFO L226 Difference]: Without dead ends: 326 [2022-12-14 15:01:57,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:01:57,771 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 141 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:01:57,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 157 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:01:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-12-14 15:01:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 316. [2022-12-14 15:01:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 228 states have (on average 1.469298245614035) internal successors, (335), 261 states have internal predecessors, (335), 43 states have call successors, (43), 19 states have call predecessors, (43), 24 states have return successors, (58), 35 states have call predecessors, (58), 43 states have call successors, (58) [2022-12-14 15:01:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 436 transitions. [2022-12-14 15:01:57,777 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 436 transitions. Word has length 23 [2022-12-14 15:01:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:01:57,778 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 436 transitions. [2022-12-14 15:01:57,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:01:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 436 transitions. [2022-12-14 15:01:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 15:01:57,778 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:01:57,778 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, 1, 1, 1] [2022-12-14 15:01:57,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 15:01:57,778 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:01:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:01:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash -787313729, now seen corresponding path program 1 times [2022-12-14 15:01:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:01:57,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855376204] [2022-12-14 15:01:57,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:57,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:01:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:01:57,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:01:57,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855376204] [2022-12-14 15:01:57,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855376204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:01:57,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:01:57,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:01:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061683439] [2022-12-14 15:01:57,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:01:57,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:01:57,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:01:57,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:01:57,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:01:57,857 INFO L87 Difference]: Start difference. First operand 316 states and 436 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:01:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:01:58,014 INFO L93 Difference]: Finished difference Result 324 states and 436 transitions. [2022-12-14 15:01:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:01:58,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-12-14 15:01:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:01:58,015 INFO L225 Difference]: With dead ends: 324 [2022-12-14 15:01:58,015 INFO L226 Difference]: Without dead ends: 324 [2022-12-14 15:01:58,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:01:58,016 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 39 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:01:58,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 241 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:01:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-12-14 15:01:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2022-12-14 15:01:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 228 states have (on average 1.4517543859649122) internal successors, (331), 261 states have internal predecessors, (331), 43 states have call successors, (43), 19 states have call predecessors, (43), 24 states have return successors, (58), 35 states have call predecessors, (58), 43 states have call successors, (58) [2022-12-14 15:01:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 432 transitions. [2022-12-14 15:01:58,030 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 432 transitions. Word has length 23 [2022-12-14 15:01:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:01:58,031 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 432 transitions. [2022-12-14 15:01:58,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:01:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 432 transitions. [2022-12-14 15:01:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 15:01:58,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:01:58,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:01:58,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 15:01:58,032 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:01:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:01:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash 840902531, now seen corresponding path program 1 times [2022-12-14 15:01:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:01:58,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557687027] [2022-12-14 15:01:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:01:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:01:58,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:01:58,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557687027] [2022-12-14 15:01:58,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557687027] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:01:58,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289960582] [2022-12-14 15:01:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:01:58,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:01:58,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:01:58,152 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:01:58,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 15:01:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:01:58,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 15:01:58,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:01:58,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:01:58,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 32 [2022-12-14 15:01:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:01:58,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:01:58,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12 [2022-12-14 15:01:58,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 [2022-12-14 15:01:58,927 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 14 treesize of output 12 [2022-12-14 15:01:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:01:58,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289960582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:01:58,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [987001407] [2022-12-14 15:01:58,931 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 15:01:58,932 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:01:58,932 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:01:58,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:01:58,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 26 [2022-12-14 15:01:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070403522] [2022-12-14 15:01:58,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:01:58,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 15:01:58,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:01:58,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 15:01:58,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:01:58,935 INFO L87 Difference]: Start difference. First operand 316 states and 432 transitions. Second operand has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 15:02:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:02:00,065 INFO L93 Difference]: Finished difference Result 496 states and 675 transitions. [2022-12-14 15:02:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 15:02:00,066 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2022-12-14 15:02:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:02:00,069 INFO L225 Difference]: With dead ends: 496 [2022-12-14 15:02:00,069 INFO L226 Difference]: Without dead ends: 496 [2022-12-14 15:02:00,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=464, Invalid=2086, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 15:02:00,071 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 844 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:02:00,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 402 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:02:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-12-14 15:02:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 319. [2022-12-14 15:02:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 231 states have (on average 1.4415584415584415) internal successors, (333), 263 states have internal predecessors, (333), 43 states have call successors, (43), 20 states have call predecessors, (43), 25 states have return successors, (58), 35 states have call predecessors, (58), 43 states have call successors, (58) [2022-12-14 15:02:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 434 transitions. [2022-12-14 15:02:00,078 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 434 transitions. Word has length 25 [2022-12-14 15:02:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:02:00,078 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 434 transitions. [2022-12-14 15:02:00,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 15:02:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 434 transitions. [2022-12-14 15:02:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 15:02:00,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:02:00,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:02:00,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 15:02:00,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 15:02:00,280 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:02:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:02:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 840902532, now seen corresponding path program 1 times [2022-12-14 15:02:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:02:00,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884713213] [2022-12-14 15:02:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:02:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:02:00,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:02:00,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884713213] [2022-12-14 15:02:00,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884713213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:02:00,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79910917] [2022-12-14 15:02:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:00,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:02:00,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:02:00,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:02:00,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 15:02:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:00,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 15:02:00,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:02:00,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:02:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:02:00,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:02:01,181 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 28 treesize of output 26 [2022-12-14 15:02:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:02:01,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79910917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:02:01,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778224542] [2022-12-14 15:02:01,206 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 15:02:01,206 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:02:01,207 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:02:01,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:02:01,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 24 [2022-12-14 15:02:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271478817] [2022-12-14 15:02:01,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:02:01,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 15:02:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:02:01,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 15:02:01,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:02:01,208 INFO L87 Difference]: Start difference. First operand 319 states and 434 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:02:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:02:02,809 INFO L93 Difference]: Finished difference Result 580 states and 809 transitions. [2022-12-14 15:02:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 15:02:02,809 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 25 [2022-12-14 15:02:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:02:02,811 INFO L225 Difference]: With dead ends: 580 [2022-12-14 15:02:02,811 INFO L226 Difference]: Without dead ends: 580 [2022-12-14 15:02:02,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 15:02:02,812 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1170 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:02:02,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 508 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 15:02:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-12-14 15:02:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 329. [2022-12-14 15:02:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 240 states have (on average 1.4208333333333334) internal successors, (341), 272 states have internal predecessors, (341), 44 states have call successors, (44), 20 states have call predecessors, (44), 25 states have return successors, (60), 36 states have call predecessors, (60), 44 states have call successors, (60) [2022-12-14 15:02:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 445 transitions. [2022-12-14 15:02:02,819 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 445 transitions. Word has length 25 [2022-12-14 15:02:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:02:02,820 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 445 transitions. [2022-12-14 15:02:02,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:02:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 445 transitions. [2022-12-14 15:02:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:02:02,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:02:02,820 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, 1, 1, 1] [2022-12-14 15:02:02,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 15:02:03,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 15:02:03,021 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:02:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:02:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash 856309015, now seen corresponding path program 1 times [2022-12-14 15:02:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:02:03,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181433796] [2022-12-14 15:02:03,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:02:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:02:03,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:02:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181433796] [2022-12-14 15:02:03,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181433796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:02:03,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:02:03,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:02:03,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103258944] [2022-12-14 15:02:03,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:02:03,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:02:03,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:02:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:02:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:02:03,082 INFO L87 Difference]: Start difference. First operand 329 states and 445 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:02:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:02:03,126 INFO L93 Difference]: Finished difference Result 336 states and 446 transitions. [2022-12-14 15:02:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:02:03,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-12-14 15:02:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:02:03,128 INFO L225 Difference]: With dead ends: 336 [2022-12-14 15:02:03,128 INFO L226 Difference]: Without dead ends: 336 [2022-12-14 15:02:03,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:02:03,128 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 23 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:02:03,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 218 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:02:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-12-14 15:02:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 326. [2022-12-14 15:02:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 239 states have (on average 1.4184100418410042) internal successors, (339), 270 states have internal predecessors, (339), 42 states have call successors, (42), 20 states have call predecessors, (42), 25 states have return successors, (58), 35 states have call predecessors, (58), 42 states have call successors, (58) [2022-12-14 15:02:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 439 transitions. [2022-12-14 15:02:03,133 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 439 transitions. Word has length 26 [2022-12-14 15:02:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:02:03,134 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 439 transitions. [2022-12-14 15:02:03,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:02:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 439 transitions. [2022-12-14 15:02:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 15:02:03,134 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:02:03,134 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, 1, 1, 1, 1, 1] [2022-12-14 15:02:03,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 15:02:03,135 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:02:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:02:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash -876853165, now seen corresponding path program 1 times [2022-12-14 15:02:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:02:03,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225204650] [2022-12-14 15:02:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:02:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:02:03,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:02:03,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225204650] [2022-12-14 15:02:03,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225204650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:02:03,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936116575] [2022-12-14 15:02:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:03,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:02:03,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:02:03,607 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:02:03,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 15:02:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:03,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-14 15:02:03,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:02:03,725 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 [2022-12-14 15:02:03,730 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 [2022-12-14 15:02:03,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:03,759 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 21 treesize of output 20 [2022-12-14 15:02:03,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:03,767 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 21 treesize of output 20 [2022-12-14 15:02:03,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:03,852 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 14 treesize of output 16 [2022-12-14 15:02:03,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:03,859 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 23 [2022-12-14 15:02:03,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:03,879 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 23 [2022-12-14 15:02:03,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:03,889 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 14 treesize of output 16 [2022-12-14 15:02:03,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:03,911 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 21 treesize of output 20 [2022-12-14 15:02:03,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:03,917 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 30 treesize of output 23 [2022-12-14 15:02:04,235 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:02:04,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-12-14 15:02:04,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,242 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 20 treesize of output 22 [2022-12-14 15:02:04,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-12-14 15:02:04,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:04,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 15:02:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:02:04,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:02:04,268 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1190 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1190) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1189 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1189) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-12-14 15:02:04,279 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)))) (and (forall ((v_ArrVal_1189 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1189) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1190 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1190) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)))) is different from false [2022-12-14 15:02:04,294 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)))) (and (forall ((v_ArrVal_1190 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1190) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1189 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1189) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2022-12-14 15:02:04,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936116575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:02:04,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [178077496] [2022-12-14 15:02:04,388 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 15:02:04,388 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:02:04,389 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:02:04,389 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:02:04,389 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:02:04,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:02:04,418 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 [2022-12-14 15:02:04,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:02:04,432 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 [2022-12-14 15:02:04,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:02:04,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:02:04,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:02:04,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:02:04,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:02:04,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:02:04,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:02:04,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:02:04,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:02:04,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:02:04,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,607 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 21 [2022-12-14 15:02:04,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:04,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:02:04,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:04,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:02:04,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2022-12-14 15:02:04,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:02:04,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:04,735 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:02:04,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 133 [2022-12-14 15:02:04,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2022-12-14 15:02:04,783 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 13 treesize of output 9 [2022-12-14 15:02:04,787 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 13 treesize of output 9 [2022-12-14 15:02:04,792 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 19 treesize of output 1 [2022-12-14 15:02:04,804 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 19 treesize of output 1 [2022-12-14 15:02:04,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:04,818 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:02:04,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:02:04,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:04,846 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:02:04,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:02:04,891 INFO L321 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-12-14 15:02:04,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 33 treesize of output 66 [2022-12-14 15:02:04,940 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:02:04,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:02:04,965 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 15:02:04,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 100 [2022-12-14 15:02:04,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:04,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:04,978 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:02:04,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 128 [2022-12-14 15:02:04,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:02:05,001 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 19 treesize of output 1 [2022-12-14 15:02:05,004 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 13 treesize of output 9 [2022-12-14 15:02:05,007 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 13 treesize of output 9 [2022-12-14 15:02:05,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:05,023 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:02:05,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:02:05,027 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 19 treesize of output 1 [2022-12-14 15:02:05,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:05,051 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:02:05,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 15:02:05,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:05,194 INFO L321 Elim1Store]: treesize reduction 62, result has 34.7 percent of original size [2022-12-14 15:02:05,195 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 130 [2022-12-14 15:02:05,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:05,231 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-12-14 15:02:05,231 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 101 [2022-12-14 15:02:05,241 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 15 treesize of output 1 [2022-12-14 15:02:05,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:02:05,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 15:02:05,350 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 15 for LOIs [2022-12-14 15:02:05,355 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:02:08,271 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14530#(and (not (= (select |#valid| |ULTIMATE.start_remove_#t~mem7#1.base|) 1)) (= (mod (+ (* 255 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) 1) 256) 0) (<= 0 |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ 8 |ULTIMATE.start_remove_~x#1.offset|) (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (<= 0 |ULTIMATE.start_main_~tail~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) |ULTIMATE.start_remove_#t~mem8#1.offset|) (< |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 256) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= 0 |ULTIMATE.start_remove_~x#1.offset|) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) |ULTIMATE.start_remove_#t~mem7#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.offset| |ULTIMATE.start_remove_~x#1.offset|) (= |ULTIMATE.start_remove_#in~x#1.base| |ULTIMATE.start_remove_~x#1.base|) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0))))) (= |ULTIMATE.start_remove_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (= |ULTIMATE.start_remove_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2022-12-14 15:02:08,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:02:08,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:02:08,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2022-12-14 15:02:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498191645] [2022-12-14 15:02:08,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:02:08,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 15:02:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:02:08,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 15:02:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1811, Unknown=3, NotChecked=264, Total=2256 [2022-12-14 15:02:08,273 INFO L87 Difference]: Start difference. First operand 326 states and 439 transitions. Second operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:02:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:02:09,998 INFO L93 Difference]: Finished difference Result 542 states and 665 transitions. [2022-12-14 15:02:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 15:02:09,998 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-12-14 15:02:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:02:09,999 INFO L225 Difference]: With dead ends: 542 [2022-12-14 15:02:09,999 INFO L226 Difference]: Without dead ends: 542 [2022-12-14 15:02:10,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=432, Invalid=3867, Unknown=3, NotChecked=390, Total=4692 [2022-12-14 15:02:10,000 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 908 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:02:10,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1021 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 15:02:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-12-14 15:02:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 335. [2022-12-14 15:02:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 245 states have (on average 1.4081632653061225) internal successors, (345), 276 states have internal predecessors, (345), 43 states have call successors, (43), 22 states have call predecessors, (43), 27 states have return successors, (59), 36 states have call predecessors, (59), 43 states have call successors, (59) [2022-12-14 15:02:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 447 transitions. [2022-12-14 15:02:10,011 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 447 transitions. Word has length 25 [2022-12-14 15:02:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:02:10,011 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 447 transitions. [2022-12-14 15:02:10,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:02:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 447 transitions. [2022-12-14 15:02:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:02:10,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:02:10,012 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, 1, 1, 1, 1, 1, 1] [2022-12-14 15:02:10,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 15:02:10,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 15:02:10,213 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:02:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:02:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash -46852464, now seen corresponding path program 1 times [2022-12-14 15:02:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:02:10,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554157391] [2022-12-14 15:02:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:10,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:02:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:02:10,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:02:10,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554157391] [2022-12-14 15:02:10,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554157391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:02:10,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:02:10,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:02:10,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917378030] [2022-12-14 15:02:10,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:02:10,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:02:10,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:02:10,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:02:10,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:02:10,360 INFO L87 Difference]: Start difference. First operand 335 states and 447 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:02:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:02:10,464 INFO L93 Difference]: Finished difference Result 341 states and 449 transitions. [2022-12-14 15:02:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:02:10,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-12-14 15:02:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:02:10,465 INFO L225 Difference]: With dead ends: 341 [2022-12-14 15:02:10,465 INFO L226 Difference]: Without dead ends: 341 [2022-12-14 15:02:10,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:02:10,466 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 39 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:02:10,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 246 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:02:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-12-14 15:02:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 333. [2022-12-14 15:02:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 243 states have (on average 1.3991769547325104) internal successors, (340), 274 states have internal predecessors, (340), 43 states have call successors, (43), 22 states have call predecessors, (43), 27 states have return successors, (59), 36 states have call predecessors, (59), 43 states have call successors, (59) [2022-12-14 15:02:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 442 transitions. [2022-12-14 15:02:10,471 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 442 transitions. Word has length 26 [2022-12-14 15:02:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:02:10,471 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 442 transitions. [2022-12-14 15:02:10,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:02:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 442 transitions. [2022-12-14 15:02:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:02:10,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:02:10,472 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:02:10,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 15:02:10,472 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:02:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:02:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2066920866, now seen corresponding path program 1 times [2022-12-14 15:02:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:02:10,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672746327] [2022-12-14 15:02:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:02:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:02:10,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:02:10,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672746327] [2022-12-14 15:02:10,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672746327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:02:10,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:02:10,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:02:10,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263428860] [2022-12-14 15:02:10,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:02:10,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:02:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:02:10,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:02:10,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:02:10,544 INFO L87 Difference]: Start difference. First operand 333 states and 442 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:02:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:02:10,697 INFO L93 Difference]: Finished difference Result 356 states and 462 transitions. [2022-12-14 15:02:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:02:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-12-14 15:02:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:02:10,699 INFO L225 Difference]: With dead ends: 356 [2022-12-14 15:02:10,699 INFO L226 Difference]: Without dead ends: 356 [2022-12-14 15:02:10,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:02:10,700 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:02:10,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 266 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:02:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-12-14 15:02:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 342. [2022-12-14 15:02:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 249 states have (on average 1.3734939759036144) internal successors, (342), 281 states have internal predecessors, (342), 46 states have call successors, (46), 22 states have call predecessors, (46), 27 states have return successors, (62), 38 states have call predecessors, (62), 46 states have call successors, (62) [2022-12-14 15:02:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 450 transitions. [2022-12-14 15:02:10,705 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 450 transitions. Word has length 28 [2022-12-14 15:02:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:02:10,705 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 450 transitions. [2022-12-14 15:02:10,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:02:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 450 transitions. [2022-12-14 15:02:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:02:10,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:02:10,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 15:02:10,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 15:02:10,706 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:02:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:02:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2027702963, now seen corresponding path program 2 times [2022-12-14 15:02:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:02:10,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794222266] [2022-12-14 15:02:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:02:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:02:11,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:02:11,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794222266] [2022-12-14 15:02:11,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794222266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:02:11,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035250820] [2022-12-14 15:02:11,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:02:11,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:02:11,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:02:11,233 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:02:11,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 15:02:11,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 15:02:11,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:02:11,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 15:02:11,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:02:11,521 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 13 treesize of output 9 [2022-12-14 15:02:11,525 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 13 treesize of output 9 [2022-12-14 15:02:11,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:11,577 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 [2022-12-14 15:02:11,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:11,583 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 29 treesize of output 28 [2022-12-14 15:02:11,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:11,885 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:02:11,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 41 [2022-12-14 15:02:11,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:02:11,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2022-12-14 15:02:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:02:11,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:02:12,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:12,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1679 treesize of output 1428 [2022-12-14 15:02:12,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1432 treesize of output 1384 [2022-12-14 15:02:15,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 738 treesize of output 726 [2022-12-14 15:02:15,493 INFO L321 Elim1Store]: treesize reduction 389, result has 16.5 percent of original size [2022-12-14 15:02:15,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 4148 treesize of output 3718 [2022-12-14 15:02:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:02:17,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035250820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:02:17,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1319165525] [2022-12-14 15:02:17,086 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 15:02:17,086 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:02:17,087 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:02:17,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:02:17,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 36 [2022-12-14 15:02:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959318352] [2022-12-14 15:02:17,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:02:17,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 15:02:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:02:17,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 15:02:17,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 15:02:17,088 INFO L87 Difference]: Start difference. First operand 342 states and 450 transitions. Second operand has 37 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 30 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:02:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:02:18,179 INFO L93 Difference]: Finished difference Result 346 states and 446 transitions. [2022-12-14 15:02:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:02:18,180 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 30 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 15:02:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:02:18,181 INFO L225 Difference]: With dead ends: 346 [2022-12-14 15:02:18,181 INFO L226 Difference]: Without dead ends: 346 [2022-12-14 15:02:18,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=1874, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 15:02:18,182 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 459 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:02:18,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 946 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:02:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-12-14 15:02:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2022-12-14 15:02:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 240 states have (on average 1.3666666666666667) internal successors, (328), 272 states have internal predecessors, (328), 44 states have call successors, (44), 21 states have call predecessors, (44), 26 states have return successors, (60), 36 states have call predecessors, (60), 44 states have call successors, (60) [2022-12-14 15:02:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 432 transitions. [2022-12-14 15:02:18,187 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 432 transitions. Word has length 30 [2022-12-14 15:02:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:02:18,187 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 432 transitions. [2022-12-14 15:02:18,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 30 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:02:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 432 transitions. [2022-12-14 15:02:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 15:02:18,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:02:18,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:02:18,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 15:02:18,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 15:02:18,388 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:02:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:02:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash 930474183, now seen corresponding path program 1 times [2022-12-14 15:02:18,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:02:18,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27660845] [2022-12-14 15:02:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:02:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:02:18,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:02:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27660845] [2022-12-14 15:02:18,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27660845] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:02:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322481828] [2022-12-14 15:02:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:02:18,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:02:18,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:02:18,741 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:02:18,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 15:02:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:02:18,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-14 15:02:18,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:02:18,900 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 13 treesize of output 9 [2022-12-14 15:02:18,903 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 13 treesize of output 9 [2022-12-14 15:02:18,948 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:02:18,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 15:02:18,958 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:02:18,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 15:02:19,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:19,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-12-14 15:02:19,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:02:19,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:19,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-12-14 15:02:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:02:19,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:02:27,644 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:02:33,722 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:02:48,623 WARN L233 SmtUtils]: Spent 14.56s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:02:48,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:48,657 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 81 [2022-12-14 15:02:48,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:48,663 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 15:02:48,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:48,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 117 [2022-12-14 15:02:48,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:48,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 96 [2022-12-14 15:02:48,707 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 102 treesize of output 78 [2022-12-14 15:02:48,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:48,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-14 15:02:48,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:48,965 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 69 [2022-12-14 15:02:48,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:48,972 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 15:02:48,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:48,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 98 [2022-12-14 15:02:49,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:49,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 96 [2022-12-14 15:02:49,025 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 91 treesize of output 71 [2022-12-14 15:02:49,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:49,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-14 15:02:49,247 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 15:02:49,248 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 1 [2022-12-14 15:02:49,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:49,254 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 71 [2022-12-14 15:02:49,296 INFO L321 Elim1Store]: treesize reduction 43, result has 43.4 percent of original size [2022-12-14 15:02:49,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 160 [2022-12-14 15:02:49,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:49,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-14 15:02:49,475 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 15:02:49,475 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 1 [2022-12-14 15:02:49,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:49,485 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 120 [2022-12-14 15:02:49,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:49,495 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 110 [2022-12-14 15:02:49,533 INFO L321 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2022-12-14 15:02:49,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 252 treesize of output 210 [2022-12-14 15:02:49,567 INFO L321 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2022-12-14 15:02:49,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 208 [2022-12-14 15:02:49,578 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 192 treesize of output 176 [2022-12-14 15:02:49,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:02:49,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 172 [2022-12-14 15:02:49,625 INFO L321 Elim1Store]: treesize reduction 14, result has 51.7 percent of original size [2022-12-14 15:02:49,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 172 [2022-12-14 15:02:49,751 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 15:02:49,751 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 1 [2022-12-14 15:02:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:02:49,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322481828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:02:49,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [812525265] [2022-12-14 15:02:49,926 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 15:02:49,926 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:02:49,926 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:02:49,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:02:49,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 17] total 38 [2022-12-14 15:02:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96763582] [2022-12-14 15:02:49,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:02:49,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 15:02:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:02:49,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 15:02:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1248, Unknown=2, NotChecked=0, Total=1406 [2022-12-14 15:02:49,928 INFO L87 Difference]: Start difference. First operand 330 states and 432 transitions. Second operand has 38 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 35 states have internal predecessors, (66), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:03:00,332 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 83 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:03:09,571 WARN L233 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 97 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:03:22,064 WARN L233 SmtUtils]: Spent 12.32s on a formula simplification. DAG size of input: 101 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:03:24,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:28,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:30,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:32,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:34,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:36,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:38,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:40,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:42,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:03:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:03:42,733 INFO L93 Difference]: Finished difference Result 405 states and 516 transitions. [2022-12-14 15:03:42,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 15:03:42,733 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 35 states have internal predecessors, (66), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2022-12-14 15:03:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:03:42,734 INFO L225 Difference]: With dead ends: 405 [2022-12-14 15:03:42,734 INFO L226 Difference]: Without dead ends: 403 [2022-12-14 15:03:42,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 60.9s TimeCoverageRelationStatistics Valid=524, Invalid=3375, Unknown=7, NotChecked=0, Total=3906 [2022-12-14 15:03:42,735 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 390 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 102 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:03:42,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1042 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1395 Invalid, 31 Unknown, 0 Unchecked, 21.2s Time] [2022-12-14 15:03:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-12-14 15:03:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 334. [2022-12-14 15:03:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 243 states have (on average 1.3621399176954732) internal successors, (331), 275 states have internal predecessors, (331), 44 states have call successors, (44), 22 states have call predecessors, (44), 27 states have return successors, (60), 36 states have call predecessors, (60), 44 states have call successors, (60) [2022-12-14 15:03:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2022-12-14 15:03:42,741 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 29 [2022-12-14 15:03:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:03:42,741 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2022-12-14 15:03:42,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 35 states have internal predecessors, (66), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:03:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2022-12-14 15:03:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 15:03:42,742 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:03:42,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:03:42,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 15:03:42,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:03:42,943 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:03:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:03:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1188508809, now seen corresponding path program 1 times [2022-12-14 15:03:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:03:42,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719405691] [2022-12-14 15:03:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:03:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:03:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:03:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:03:43,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:03:43,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719405691] [2022-12-14 15:03:43,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719405691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:03:43,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367313331] [2022-12-14 15:03:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:03:43,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:03:43,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:03:43,242 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:03:43,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 15:03:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:03:43,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 15:03:43,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:03:43,433 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 [2022-12-14 15:03:43,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:03:43,467 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 21 treesize of output 20 [2022-12-14 15:03:43,491 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:03:43,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 25 [2022-12-14 15:03:43,497 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 11 treesize of output 7 [2022-12-14 15:03:43,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 15:03:43,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2022-12-14 15:03:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:03:43,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:03:43,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 [2022-12-14 15:03:43,960 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-14 15:03:43,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-12-14 15:03:44,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 [2022-12-14 15:03:44,205 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-14 15:03:44,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-12-14 15:03:44,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:03:44,577 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-12-14 15:03:44,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 22 [2022-12-14 15:03:44,583 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 9 treesize of output 7 [2022-12-14 15:03:44,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:03:44,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:03:44,596 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-12-14 15:03:44,608 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 15:03:44,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-12-14 15:03:44,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 15:03:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:03:44,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367313331] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:03:44,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [411057027] [2022-12-14 15:03:44,663 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 15:03:44,663 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:03:44,663 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:03:44,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:03:44,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 37 [2022-12-14 15:03:44,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505203325] [2022-12-14 15:03:44,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:03:44,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 15:03:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:03:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 15:03:44,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1231, Unknown=15, NotChecked=0, Total=1406 [2022-12-14 15:03:44,665 INFO L87 Difference]: Start difference. First operand 334 states and 435 transitions. Second operand has 38 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 15:03:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:03:47,529 INFO L93 Difference]: Finished difference Result 498 states and 668 transitions. [2022-12-14 15:03:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 15:03:47,530 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2022-12-14 15:03:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:03:47,532 INFO L225 Difference]: With dead ends: 498 [2022-12-14 15:03:47,532 INFO L226 Difference]: Without dead ends: 498 [2022-12-14 15:03:47,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=689, Invalid=3852, Unknown=15, NotChecked=0, Total=4556 [2022-12-14 15:03:47,533 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 459 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 135 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:03:47,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1097 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2239 Invalid, 2 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 15:03:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-12-14 15:03:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 340. [2022-12-14 15:03:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 280 states have internal predecessors, (337), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (59), 37 states have call predecessors, (59), 45 states have call successors, (59) [2022-12-14 15:03:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 441 transitions. [2022-12-14 15:03:47,544 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 441 transitions. Word has length 31 [2022-12-14 15:03:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:03:47,544 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 441 transitions. [2022-12-14 15:03:47,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 15:03:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 441 transitions. [2022-12-14 15:03:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 15:03:47,545 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:03:47,545 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:03:47,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 15:03:47,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 15:03:47,747 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:03:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:03:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1188508810, now seen corresponding path program 1 times [2022-12-14 15:03:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:03:47,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321698306] [2022-12-14 15:03:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:03:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:03:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:03:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:03:48,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:03:48,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321698306] [2022-12-14 15:03:48,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321698306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:03:48,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065934388] [2022-12-14 15:03:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:03:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:03:48,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:03:48,220 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:03:48,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 15:03:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:03:48,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-14 15:03:48,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:03:48,405 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 [2022-12-14 15:03:48,417 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 [2022-12-14 15:03:48,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:03:48,460 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 21 treesize of output 20 [2022-12-14 15:03:48,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:03:48,469 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 21 treesize of output 20 [2022-12-14 15:03:48,503 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:03:48,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 15:03:48,519 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:03:48,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 15:03:48,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 15:03:48,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 15:03:48,953 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 15:03:48,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2022-12-14 15:03:48,960 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 15:03:48,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-12-14 15:03:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:03:48,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:03:49,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:03:49,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-12-14 15:04:08,391 WARN L233 SmtUtils]: Spent 16.57s on a formula simplification. DAG size of input: 46 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:04:14,865 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:04:15,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:15,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-12-14 15:04:19,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,073 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 53 [2022-12-14 15:04:19,093 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-14 15:04:19,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 108 [2022-12-14 15:04:19,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 108 [2022-12-14 15:04:19,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,221 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 53 [2022-12-14 15:04:19,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:19,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-12-14 15:04:19,235 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 24 treesize of output 16 [2022-12-14 15:04:19,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,247 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 76 [2022-12-14 15:04:19,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,257 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-12-14 15:04:19,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:19,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 34 [2022-12-14 15:04:19,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2022-12-14 15:04:19,273 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 29 treesize of output 17 [2022-12-14 15:04:19,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 7 [2022-12-14 15:04:19,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,293 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 76 [2022-12-14 15:04:19,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,303 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-12-14 15:04:19,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:19,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 34 [2022-12-14 15:04:19,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:19,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 14 [2022-12-14 15:04:19,321 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 25 treesize of output 13 [2022-12-14 15:04:19,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 15:04:19,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,333 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-14 15:04:19,333 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 1 [2022-12-14 15:04:19,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,339 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-14 15:04:19,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 1 [2022-12-14 15:04:19,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,345 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-14 15:04:19,345 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 1 [2022-12-14 15:04:19,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,351 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-14 15:04:19,351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 1 [2022-12-14 15:04:19,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,356 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-14 15:04:19,357 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 1 [2022-12-14 15:04:19,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:19,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 53 [2022-12-14 15:04:19,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:19,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:04:19,373 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 15:04:19,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2022-12-14 15:04:19,376 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 8 treesize of output 4 [2022-12-14 15:04:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:04:19,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065934388] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:04:19,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [460036689] [2022-12-14 15:04:19,499 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 15:04:19,499 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:04:19,500 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:04:19,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:04:19,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 17] total 41 [2022-12-14 15:04:19,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289620249] [2022-12-14 15:04:19,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:04:19,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 15:04:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:04:19,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 15:04:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1552, Unknown=7, NotChecked=0, Total=1722 [2022-12-14 15:04:19,502 INFO L87 Difference]: Start difference. First operand 340 states and 441 transitions. Second operand has 42 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:04:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:04:31,851 INFO L93 Difference]: Finished difference Result 462 states and 594 transitions. [2022-12-14 15:04:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 15:04:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2022-12-14 15:04:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:04:31,854 INFO L225 Difference]: With dead ends: 462 [2022-12-14 15:04:31,854 INFO L226 Difference]: Without dead ends: 462 [2022-12-14 15:04:31,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=614, Invalid=4209, Unknown=7, NotChecked=0, Total=4830 [2022-12-14 15:04:31,856 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 614 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 174 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:04:31,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 835 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 2525 Invalid, 8 Unknown, 0 Unchecked, 7.3s Time] [2022-12-14 15:04:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-12-14 15:04:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 362. [2022-12-14 15:04:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 264 states have (on average 1.3636363636363635) internal successors, (360), 298 states have internal predecessors, (360), 50 states have call successors, (50), 23 states have call predecessors, (50), 28 states have return successors, (64), 40 states have call predecessors, (64), 50 states have call successors, (64) [2022-12-14 15:04:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 474 transitions. [2022-12-14 15:04:31,866 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 474 transitions. Word has length 31 [2022-12-14 15:04:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:04:31,866 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 474 transitions. [2022-12-14 15:04:31,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:04:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 474 transitions. [2022-12-14 15:04:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 15:04:31,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:04:31,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:04:31,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 15:04:32,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-14 15:04:32,068 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:04:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:04:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash -412716431, now seen corresponding path program 1 times [2022-12-14 15:04:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:04:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508566795] [2022-12-14 15:04:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:04:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:04:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:04:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:04:32,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:04:32,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508566795] [2022-12-14 15:04:32,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508566795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:04:32,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759355129] [2022-12-14 15:04:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:04:32,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:04:32,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:04:32,153 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:04:32,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 15:04:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:04:32,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 15:04:32,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:04:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:04:32,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:04:32,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759355129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:04:32,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:04:32,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2022-12-14 15:04:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554730860] [2022-12-14 15:04:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:04:32,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:04:32,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:04:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:04:32,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:04:32,309 INFO L87 Difference]: Start difference. First operand 362 states and 474 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:04:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:04:32,525 INFO L93 Difference]: Finished difference Result 371 states and 483 transitions. [2022-12-14 15:04:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:04:32,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-12-14 15:04:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:04:32,527 INFO L225 Difference]: With dead ends: 371 [2022-12-14 15:04:32,527 INFO L226 Difference]: Without dead ends: 371 [2022-12-14 15:04:32,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:04:32,527 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 139 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:04:32,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 132 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:04:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-12-14 15:04:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 361. [2022-12-14 15:04:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 264 states have (on average 1.3295454545454546) internal successors, (351), 297 states have internal predecessors, (351), 50 states have call successors, (50), 23 states have call predecessors, (50), 28 states have return successors, (64), 40 states have call predecessors, (64), 50 states have call successors, (64) [2022-12-14 15:04:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2022-12-14 15:04:32,535 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 31 [2022-12-14 15:04:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:04:32,536 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2022-12-14 15:04:32,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:04:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2022-12-14 15:04:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 15:04:32,537 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:04:32,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:04:32,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 15:04:32,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 15:04:32,737 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:04:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:04:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash -412716430, now seen corresponding path program 1 times [2022-12-14 15:04:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:04:32,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488689037] [2022-12-14 15:04:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:04:32,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:04:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:04:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:04:32,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:04:32,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488689037] [2022-12-14 15:04:32,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488689037] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:04:32,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079462305] [2022-12-14 15:04:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:04:32,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:04:32,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:04:32,914 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:04:32,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 15:04:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:04:33,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 15:04:33,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:04:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:04:33,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:04:33,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079462305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:04:33,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:04:33,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 16 [2022-12-14 15:04:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122227213] [2022-12-14 15:04:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:04:33,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:04:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:04:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:04:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:04:33,202 INFO L87 Difference]: Start difference. First operand 361 states and 465 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:04:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:04:33,644 INFO L93 Difference]: Finished difference Result 430 states and 559 transitions. [2022-12-14 15:04:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:04:33,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-12-14 15:04:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:04:33,646 INFO L225 Difference]: With dead ends: 430 [2022-12-14 15:04:33,646 INFO L226 Difference]: Without dead ends: 430 [2022-12-14 15:04:33,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-12-14 15:04:33,646 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 291 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:04:33,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 256 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:04:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-12-14 15:04:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 366. [2022-12-14 15:04:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 269 states have (on average 1.3197026022304832) internal successors, (355), 302 states have internal predecessors, (355), 50 states have call successors, (50), 23 states have call predecessors, (50), 28 states have return successors, (64), 40 states have call predecessors, (64), 50 states have call successors, (64) [2022-12-14 15:04:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 469 transitions. [2022-12-14 15:04:33,653 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 469 transitions. Word has length 31 [2022-12-14 15:04:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:04:33,653 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 469 transitions. [2022-12-14 15:04:33,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:04:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 469 transitions. [2022-12-14 15:04:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 15:04:33,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:04:33,654 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:04:33,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 15:04:33,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 15:04:33,855 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:04:33,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:04:33,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1898251068, now seen corresponding path program 2 times [2022-12-14 15:04:33,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:04:33,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506544940] [2022-12-14 15:04:33,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:04:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:04:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:04:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 15:04:34,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:04:34,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506544940] [2022-12-14 15:04:34,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506544940] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:04:34,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396363795] [2022-12-14 15:04:34,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:04:34,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:04:34,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:04:34,447 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:04:34,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 15:04:34,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 15:04:34,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:04:34,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 15:04:34,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:04:34,680 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 13 treesize of output 9 [2022-12-14 15:04:34,683 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 13 treesize of output 9 [2022-12-14 15:04:35,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:35,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-12-14 15:04:35,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:04:35,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 36 [2022-12-14 15:04:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 15:04:35,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:04:35,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 28 [2022-12-14 15:04:35,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:35,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:35,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:35,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:04:35,946 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 8 treesize of output 6 [2022-12-14 15:04:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 15:04:36,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396363795] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:04:36,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [893096101] [2022-12-14 15:04:36,026 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 15:04:36,026 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:04:36,026 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:04:36,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:04:36,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-12-14 15:04:36,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585994816] [2022-12-14 15:04:36,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:04:36,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 15:04:36,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:04:36,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 15:04:36,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 15:04:36,028 INFO L87 Difference]: Start difference. First operand 366 states and 469 transitions. Second operand has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:04:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:04:42,301 INFO L93 Difference]: Finished difference Result 528 states and 652 transitions. [2022-12-14 15:04:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 15:04:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-12-14 15:04:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:04:42,304 INFO L225 Difference]: With dead ends: 528 [2022-12-14 15:04:42,304 INFO L226 Difference]: Without dead ends: 509 [2022-12-14 15:04:42,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=891, Invalid=5589, Unknown=0, NotChecked=0, Total=6480 [2022-12-14 15:04:42,305 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1836 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:04:42,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 903 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-14 15:04:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-12-14 15:04:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 326. [2022-12-14 15:04:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 242 states have (on average 1.334710743801653) internal successors, (323), 270 states have internal predecessors, (323), 44 states have call successors, (44), 23 states have call predecessors, (44), 24 states have return successors, (54), 32 states have call predecessors, (54), 43 states have call successors, (54) [2022-12-14 15:04:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 421 transitions. [2022-12-14 15:04:42,311 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 421 transitions. Word has length 35 [2022-12-14 15:04:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:04:42,311 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 421 transitions. [2022-12-14 15:04:42,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:04:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 421 transitions. [2022-12-14 15:04:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 15:04:42,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:04:42,312 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:04:42,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 15:04:42,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:04:42,513 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:04:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:04:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1263222508, now seen corresponding path program 1 times [2022-12-14 15:04:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:04:42,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052203565] [2022-12-14 15:04:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:04:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:04:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:04:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:04:42,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:04:42,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052203565] [2022-12-14 15:04:42,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052203565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:04:42,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:04:42,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:04:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638621788] [2022-12-14 15:04:42,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:04:42,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:04:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:04:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:04:42,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:04:42,639 INFO L87 Difference]: Start difference. First operand 326 states and 421 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:04:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:04:42,758 INFO L93 Difference]: Finished difference Result 372 states and 480 transitions. [2022-12-14 15:04:42,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:04:42,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-12-14 15:04:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:04:42,760 INFO L225 Difference]: With dead ends: 372 [2022-12-14 15:04:42,760 INFO L226 Difference]: Without dead ends: 372 [2022-12-14 15:04:42,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:04:42,760 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 44 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:04:42,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 286 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:04:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-12-14 15:04:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 341. [2022-12-14 15:04:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 255 states have (on average 1.3333333333333333) internal successors, (340), 280 states have internal predecessors, (340), 45 states have call successors, (45), 23 states have call predecessors, (45), 25 states have return successors, (58), 37 states have call predecessors, (58), 45 states have call successors, (58) [2022-12-14 15:04:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 443 transitions. [2022-12-14 15:04:42,768 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 443 transitions. Word has length 34 [2022-12-14 15:04:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:04:42,768 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 443 transitions. [2022-12-14 15:04:42,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:04:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 443 transitions. [2022-12-14 15:04:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 15:04:42,769 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:04:42,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:04:42,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-14 15:04:42,769 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:04:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:04:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1320147351, now seen corresponding path program 2 times [2022-12-14 15:04:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:04:42,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118078631] [2022-12-14 15:04:42,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:04:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:04:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:04:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:04:43,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:04:43,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118078631] [2022-12-14 15:04:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118078631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:04:43,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646781282] [2022-12-14 15:04:43,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:04:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:04:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:04:43,512 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:04:43,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 15:04:43,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 15:04:43,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:04:43,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-14 15:04:43,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:04:43,677 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 13 treesize of output 9 [2022-12-14 15:04:43,683 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 13 treesize of output 9 [2022-12-14 15:04:43,734 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 15:04:43,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-12-14 15:04:43,746 INFO L321 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2022-12-14 15:04:43,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-12-14 15:04:45,247 INFO L321 Elim1Store]: treesize reduction 44, result has 71.2 percent of original size [2022-12-14 15:04:45,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 189 [2022-12-14 15:04:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 15:04:46,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:04:46,160 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 15:04:46,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 15:05:25,775 WARN L233 SmtUtils]: Spent 18.16s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:05:43,948 WARN L233 SmtUtils]: Spent 18.05s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:05:44,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:05:44,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 7881 treesize of output 6982 [2022-12-14 15:05:44,928 INFO L321 Elim1Store]: treesize reduction 175, result has 53.1 percent of original size [2022-12-14 15:05:44,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 11101 treesize of output 10186 [2022-12-14 15:06:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 15:06:02,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646781282] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:06:02,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [121428018] [2022-12-14 15:06:02,747 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 15:06:02,747 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:06:02,747 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:06:02,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:06:02,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 43 [2022-12-14 15:06:02,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052399976] [2022-12-14 15:06:02,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:06:02,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 15:06:02,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:06:02,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 15:06:02,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1639, Unknown=8, NotChecked=0, Total=1806 [2022-12-14 15:06:02,749 INFO L87 Difference]: Start difference. First operand 341 states and 443 transitions. Second operand has 43 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:06:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:06:11,664 INFO L93 Difference]: Finished difference Result 462 states and 601 transitions. [2022-12-14 15:06:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 15:06:11,664 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-12-14 15:06:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:06:11,666 INFO L225 Difference]: With dead ends: 462 [2022-12-14 15:06:11,666 INFO L226 Difference]: Without dead ends: 462 [2022-12-14 15:06:11,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 63.1s TimeCoverageRelationStatistics Valid=580, Invalid=4382, Unknown=8, NotChecked=0, Total=4970 [2022-12-14 15:06:11,666 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 624 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:06:11,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1437 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 15:06:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-12-14 15:06:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 386. [2022-12-14 15:06:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 289 states have (on average 1.328719723183391) internal successors, (384), 316 states have internal predecessors, (384), 52 states have call successors, (52), 25 states have call predecessors, (52), 29 states have return successors, (74), 44 states have call predecessors, (74), 52 states have call successors, (74) [2022-12-14 15:06:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2022-12-14 15:06:11,671 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 34 [2022-12-14 15:06:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:06:11,671 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2022-12-14 15:06:11,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:06:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2022-12-14 15:06:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 15:06:11,672 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:06:11,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:06:11,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-14 15:06:11,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 15:06:11,873 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:06:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:06:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1256247037, now seen corresponding path program 1 times [2022-12-14 15:06:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:06:11,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118518310] [2022-12-14 15:06:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:06:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:06:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:06:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:06:12,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:06:12,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118518310] [2022-12-14 15:06:12,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118518310] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:06:12,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897407272] [2022-12-14 15:06:12,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:06:12,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:06:12,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:06:12,865 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:06:12,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 15:06:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:06:12,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 15:06:12,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:06:12,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:06:13,037 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:06:13,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 15:06:13,070 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 13 treesize of output 9 [2022-12-14 15:06:15,093 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_53| Int)) (not (= |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_53| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_51| 4))))) is different from true [2022-12-14 15:06:23,334 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:06:23,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2022-12-14 15:06:23,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 13 [2022-12-14 15:06:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:06:23,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:06:23,750 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-12-14 15:06:23,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:06:23,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 26 [2022-12-14 15:06:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:06:24,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897407272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:06:24,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1237081103] [2022-12-14 15:06:24,095 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 15:06:24,095 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:06:24,095 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:06:24,095 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:06:24,095 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:06:24,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:06:24,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:06:24,127 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 [2022-12-14 15:06:24,132 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 [2022-12-14 15:06:24,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:06:24,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:06:24,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:06:24,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:06:24,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:06:24,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:06:24,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:06:24,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:06:24,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:06:24,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:06:24,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:06:24,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:06:24,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,303 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 21 [2022-12-14 15:06:24,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:06:24,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:06:24,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2022-12-14 15:06:24,384 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 [2022-12-14 15:06:24,388 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 15 treesize of output 1 [2022-12-14 15:06:24,392 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 [2022-12-14 15:06:24,398 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 19 treesize of output 1 [2022-12-14 15:06:24,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:06:24,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:06:24,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:06:24,432 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:06:24,432 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 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-14 15:06:24,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:06:24,450 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:06:24,451 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 15:06:24,457 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 19 treesize of output 1 [2022-12-14 15:06:24,492 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:06:24,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:06:24,502 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-14 15:06:24,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2022-12-14 15:06:24,511 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 [2022-12-14 15:06:24,514 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 [2022-12-14 15:06:24,518 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 15 treesize of output 1 [2022-12-14 15:06:24,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:06:24,529 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 19 treesize of output 1 [2022-12-14 15:06:24,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:06:24,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:06:24,555 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:06:24,555 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 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-14 15:06:24,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:06:24,575 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:06:24,575 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 15:06:24,581 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 19 treesize of output 1 [2022-12-14 15:06:24,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,711 INFO L321 Elim1Store]: treesize reduction 62, result has 34.7 percent of original size [2022-12-14 15:06:24,711 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 130 [2022-12-14 15:06:24,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:06:24,747 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-12-14 15:06:24,747 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 101 [2022-12-14 15:06:24,756 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 15 treesize of output 1 [2022-12-14 15:06:25,023 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 64 for LOIs [2022-12-14 15:06:25,081 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 12 for LOIs [2022-12-14 15:06:25,084 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:06:36,746 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '26074#(and (= (select |#valid| |ULTIMATE.start_re_insert_~x#1.base|) 1) (<= 0 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 0 |ULTIMATE.start_remove_#in~x#1.offset|) (= |ULTIMATE.start_re_insert_#in~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 0 |ULTIMATE.start_main_~tail~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_re_insert_~x#1.base|) (+ |ULTIMATE.start_re_insert_~x#1.offset| 4)) |ULTIMATE.start_re_insert_#t~mem10#1.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_re_insert_~x#1.base|) (+ |ULTIMATE.start_re_insert_~x#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_re_insert_~x#1.base|) (+ |ULTIMATE.start_re_insert_~x#1.offset| 4)) 0))) (<= 0 |ULTIMATE.start_main_~x~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 256) (= |ULTIMATE.start_re_insert_~x#1.base| |ULTIMATE.start_re_insert_#in~x#1.base|) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_remove_~x#1.offset|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= 0 |ULTIMATE.start_remove_~x#1.base|) (<= |ULTIMATE.start_remove_#in~x#1.offset| 0) (= |ULTIMATE.start_re_insert_#t~mem10#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_re_insert_~x#1.base|) (+ |ULTIMATE.start_re_insert_~x#1.offset| 4))) (<= (+ |ULTIMATE.start_re_insert_~x#1.offset| 8) (select |#length| |ULTIMATE.start_re_insert_~x#1.base|)) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_remove_#in~x#1.base|) (not (= (select |#valid| |ULTIMATE.start_re_insert_#t~mem10#1.base|) 1)) (= |ULTIMATE.start_re_insert_~x#1.offset| |ULTIMATE.start_re_insert_#in~x#1.offset|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 256) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_re_insert_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= |ULTIMATE.start_remove_~x#1.offset| 0) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2022-12-14 15:06:36,746 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:06:36,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:06:36,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 13] total 41 [2022-12-14 15:06:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019242574] [2022-12-14 15:06:36,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:06:36,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 15:06:36,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:06:36,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 15:06:36,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4378, Unknown=7, NotChecked=134, Total=4830 [2022-12-14 15:06:36,748 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 38 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 15:06:45,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:06:47,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:06:49,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:06:59,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:01,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:07,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:09,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:11,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:14,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:22,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:34,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:36,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:39,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:41,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:43,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:45,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:47,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:49,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:51,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:54,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:56,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:07:58,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:08:00,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:08:02,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:08:04,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:08:06,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:08:08,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:08:13,191 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and .cse0 (= (select |c_#valid| (select .cse1 .cse2)) 1) .cse3 (= (select |c_#valid| (select .cse4 .cse5)) 1) (= (select .cse6 .cse5) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (+ |c_ULTIMATE.start_re_insert_~x#1.offset| 4))) 1) (not (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~n~0#1.offset| 0) (not (= (select .cse1 .cse5) |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base|) 1) (or (not .cse0) (forall ((v_ArrVal_2111 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_2111) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) .cse7))) (not .cse3)))) is different from false [2022-12-14 15:08:15,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:08:17,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:08:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:08:18,088 INFO L93 Difference]: Finished difference Result 532 states and 693 transitions. [2022-12-14 15:08:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-14 15:08:18,089 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 38 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2022-12-14 15:08:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:08:18,090 INFO L225 Difference]: With dead ends: 532 [2022-12-14 15:08:18,090 INFO L226 Difference]: Without dead ends: 532 [2022-12-14 15:08:18,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3975 ImplicationChecksByTransitivity, 63.0s TimeCoverageRelationStatistics Valid=1278, Invalid=10912, Unknown=28, NotChecked=438, Total=12656 [2022-12-14 15:08:18,091 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 986 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 2357 mSolverCounterSat, 374 mSolverCounterUnsat, 48 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2357 IncrementalHoareTripleChecker+Invalid, 48 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 61.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:08:18,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 917 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2357 Invalid, 48 Unknown, 280 Unchecked, 61.1s Time] [2022-12-14 15:08:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-12-14 15:08:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 414. [2022-12-14 15:08:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 314 states have (on average 1.3471337579617835) internal successors, (423), 340 states have internal predecessors, (423), 55 states have call successors, (55), 25 states have call predecessors, (55), 29 states have return successors, (83), 48 states have call predecessors, (83), 55 states have call successors, (83) [2022-12-14 15:08:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 561 transitions. [2022-12-14 15:08:18,101 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 561 transitions. Word has length 34 [2022-12-14 15:08:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:08:18,101 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 561 transitions. [2022-12-14 15:08:18,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 38 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 15:08:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 561 transitions. [2022-12-14 15:08:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 15:08:18,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:08:18,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:08:18,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-14 15:08:18,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:08:18,303 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:08:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:08:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1256247038, now seen corresponding path program 1 times [2022-12-14 15:08:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:08:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397901081] [2022-12-14 15:08:18,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:08:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:08:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:08:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:08:19,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:08:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397901081] [2022-12-14 15:08:19,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397901081] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:08:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101829709] [2022-12-14 15:08:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:08:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:08:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:08:19,388 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:08:19,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 15:08:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:08:19,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-14 15:08:19,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:08:19,700 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 13 treesize of output 9 [2022-12-14 15:08:19,704 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 13 treesize of output 9 [2022-12-14 15:08:20,158 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:08:20,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:08:20,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:20,165 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 20 treesize of output 22 [2022-12-14 15:08:20,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 14 [2022-12-14 15:08:20,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-12-14 15:08:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:08:20,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:08:20,518 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_2196 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_2196) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (forall ((v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2196 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_2196) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_2197) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)))))) is different from false [2022-12-14 15:08:21,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101829709] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:08:21,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [443557572] [2022-12-14 15:08:21,085 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 15:08:21,085 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:08:21,085 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:08:21,085 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:08:21,085 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:08:21,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:08:21,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:08:21,115 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 [2022-12-14 15:08:21,119 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 [2022-12-14 15:08:21,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:08:21,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:08:21,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:08:21,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 15:08:21,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:08:21,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-12-14 15:08:21,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 15:08:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 15:08:21,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:08:21,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 15:08:21,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:08:21,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:08:21,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,307 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 21 [2022-12-14 15:08:21,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:08:21,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 15:08:21,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2022-12-14 15:08:21,391 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 15 treesize of output 1 [2022-12-14 15:08:21,394 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 [2022-12-14 15:08:21,398 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 [2022-12-14 15:08:21,406 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 19 treesize of output 1 [2022-12-14 15:08:21,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:08:21,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:08:21,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:08:21,441 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:08:21,441 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 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-14 15:08:21,448 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 19 treesize of output 1 [2022-12-14 15:08:21,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:08:21,466 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:08:21,466 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 15:08:21,505 INFO L321 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2022-12-14 15:08:21,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 15:08:21,517 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-14 15:08:21,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-12-14 15:08:21,528 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 [2022-12-14 15:08:21,532 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 15 treesize of output 1 [2022-12-14 15:08:21,536 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 [2022-12-14 15:08:21,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:08:21,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:08:21,558 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 19 treesize of output 1 [2022-12-14 15:08:21,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:08:21,582 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:08:21,582 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 15:08:21,588 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 19 treesize of output 1 [2022-12-14 15:08:21,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:08:21,605 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 15:08:21,606 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 1 case distinctions, treesize of input 30 treesize of output 36 [2022-12-14 15:08:21,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,750 INFO L321 Elim1Store]: treesize reduction 62, result has 34.7 percent of original size [2022-12-14 15:08:21,750 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 130 [2022-12-14 15:08:21,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:08:21,786 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-12-14 15:08:21,787 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 101 [2022-12-14 15:08:21,798 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 15 treesize of output 1 [2022-12-14 15:08:22,027 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 64 for LOIs [2022-12-14 15:08:22,083 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 12 for LOIs [2022-12-14 15:08:22,088 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:08:28,502 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '27342#(and (= (select |#valid| |ULTIMATE.start_re_insert_~x#1.base|) 1) (<= 0 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_re_insert_#t~mem10#1.offset| 4) (select |#length| |ULTIMATE.start_re_insert_#t~mem10#1.base|))) (not (<= 0 |ULTIMATE.start_re_insert_#t~mem10#1.offset|))) (<= 0 |ULTIMATE.start_remove_#in~x#1.offset|) (= |ULTIMATE.start_re_insert_#in~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 0 |ULTIMATE.start_main_~tail~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_re_insert_~x#1.base|) (+ |ULTIMATE.start_re_insert_~x#1.offset| 4)) |ULTIMATE.start_re_insert_#t~mem10#1.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_re_insert_~x#1.base|) (+ |ULTIMATE.start_re_insert_~x#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_re_insert_~x#1.base|) (+ |ULTIMATE.start_re_insert_~x#1.offset| 4)) 0))) (<= 0 |ULTIMATE.start_main_~x~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 256) (= |ULTIMATE.start_re_insert_~x#1.base| |ULTIMATE.start_re_insert_#in~x#1.base|) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_remove_~x#1.offset|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= 0 |ULTIMATE.start_remove_~x#1.base|) (<= |ULTIMATE.start_remove_#in~x#1.offset| 0) (= |ULTIMATE.start_re_insert_#t~mem10#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_re_insert_~x#1.base|) (+ |ULTIMATE.start_re_insert_~x#1.offset| 4))) (<= (+ |ULTIMATE.start_re_insert_~x#1.offset| 8) (select |#length| |ULTIMATE.start_re_insert_~x#1.base|)) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_remove_#in~x#1.base|) (= |ULTIMATE.start_re_insert_~x#1.offset| |ULTIMATE.start_re_insert_#in~x#1.offset|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 256) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_re_insert_#in~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= |ULTIMATE.start_remove_~x#1.offset| 0) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2022-12-14 15:08:28,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:08:28,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:08:28,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 35 [2022-12-14 15:08:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580982242] [2022-12-14 15:08:28,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:08:28,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 15:08:28,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:08:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 15:08:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=4657, Unknown=1, NotChecked=138, Total=5112 [2022-12-14 15:08:28,504 INFO L87 Difference]: Start difference. First operand 414 states and 561 transitions. Second operand has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:08:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:08:33,348 INFO L93 Difference]: Finished difference Result 480 states and 632 transitions. [2022-12-14 15:08:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 15:08:33,349 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-12-14 15:08:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:08:33,350 INFO L225 Difference]: With dead ends: 480 [2022-12-14 15:08:33,350 INFO L226 Difference]: Without dead ends: 480 [2022-12-14 15:08:33,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2761 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=862, Invalid=8071, Unknown=1, NotChecked=186, Total=9120 [2022-12-14 15:08:33,351 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 941 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:08:33,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 821 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 15:08:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-12-14 15:08:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 418. [2022-12-14 15:08:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 318 states have (on average 1.349056603773585) internal successors, (429), 344 states have internal predecessors, (429), 55 states have call successors, (55), 25 states have call predecessors, (55), 29 states have return successors, (83), 48 states have call predecessors, (83), 55 states have call successors, (83) [2022-12-14 15:08:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 567 transitions. [2022-12-14 15:08:33,356 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 567 transitions. Word has length 34 [2022-12-14 15:08:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:08:33,357 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 567 transitions. [2022-12-14 15:08:33,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:08:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 567 transitions. [2022-12-14 15:08:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 15:08:33,357 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:08:33,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:08:33,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-14 15:08:33,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:08:33,559 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:08:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:08:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash 984711155, now seen corresponding path program 1 times [2022-12-14 15:08:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:08:33,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610626268] [2022-12-14 15:08:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:08:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:08:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:08:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 15:08:33,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:08:33,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610626268] [2022-12-14 15:08:33,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610626268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:08:33,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:08:33,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:08:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549797189] [2022-12-14 15:08:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:08:33,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:08:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:08:33,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:08:33,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:08:33,633 INFO L87 Difference]: Start difference. First operand 418 states and 567 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 15:08:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:08:33,711 INFO L93 Difference]: Finished difference Result 436 states and 586 transitions. [2022-12-14 15:08:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:08:33,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-12-14 15:08:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:08:33,713 INFO L225 Difference]: With dead ends: 436 [2022-12-14 15:08:33,713 INFO L226 Difference]: Without dead ends: 436 [2022-12-14 15:08:33,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:08:33,713 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 5 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:08:33,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 341 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:08:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-12-14 15:08:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 406. [2022-12-14 15:08:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 309 states have (on average 1.3462783171521036) internal successors, (416), 332 states have internal predecessors, (416), 52 states have call successors, (52), 25 states have call predecessors, (52), 29 states have return successors, (74), 48 states have call predecessors, (74), 52 states have call successors, (74) [2022-12-14 15:08:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 542 transitions. [2022-12-14 15:08:33,718 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 542 transitions. Word has length 36 [2022-12-14 15:08:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:08:33,718 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 542 transitions. [2022-12-14 15:08:33,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 15:08:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 542 transitions. [2022-12-14 15:08:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 15:08:33,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:08:33,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:08:33,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-14 15:08:33,719 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:08:33,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:08:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash -367071043, now seen corresponding path program 1 times [2022-12-14 15:08:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:08:33,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927986012] [2022-12-14 15:08:33,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:08:33,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:08:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:08:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 15:08:33,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:08:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927986012] [2022-12-14 15:08:33,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927986012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:08:33,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:08:33,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:08:33,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458910633] [2022-12-14 15:08:33,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:08:33,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:08:33,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:08:33,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:08:33,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:08:33,793 INFO L87 Difference]: Start difference. First operand 406 states and 542 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 15:08:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:08:33,838 INFO L93 Difference]: Finished difference Result 352 states and 452 transitions. [2022-12-14 15:08:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:08:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-12-14 15:08:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:08:33,839 INFO L225 Difference]: With dead ends: 352 [2022-12-14 15:08:33,839 INFO L226 Difference]: Without dead ends: 346 [2022-12-14 15:08:33,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:08:33,840 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:08:33,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:08:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-12-14 15:08:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 300. [2022-12-14 15:08:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 227 states have (on average 1.303964757709251) internal successors, (296), 247 states have internal predecessors, (296), 35 states have call successors, (35), 21 states have call predecessors, (35), 24 states have return successors, (46), 31 states have call predecessors, (46), 35 states have call successors, (46) [2022-12-14 15:08:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 377 transitions. [2022-12-14 15:08:33,844 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 377 transitions. Word has length 36 [2022-12-14 15:08:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:08:33,844 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 377 transitions. [2022-12-14 15:08:33,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 15:08:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 377 transitions. [2022-12-14 15:08:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 15:08:33,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:08:33,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:08:33,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-14 15:08:33,845 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:08:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:08:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1290235477, now seen corresponding path program 2 times [2022-12-14 15:08:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:08:33,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033243858] [2022-12-14 15:08:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:08:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:08:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:08:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:08:34,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:08:34,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033243858] [2022-12-14 15:08:34,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033243858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:08:34,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011079756] [2022-12-14 15:08:34,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:08:34,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:08:34,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:08:34,347 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:08:34,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 15:08:34,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 15:08:34,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:08:34,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 15:08:34,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:08:34,530 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 [2022-12-14 15:08:34,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:08:34,568 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-14 15:08:34,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2022-12-14 15:08:34,572 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 33 treesize of output 19 [2022-12-14 15:08:34,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:08:34,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 42 [2022-12-14 15:08:39,288 INFO L321 Elim1Store]: treesize reduction 66, result has 9.6 percent of original size [2022-12-14 15:08:39,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 32 [2022-12-14 15:08:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 15:08:39,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:08:49,984 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:08:58,091 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:08:58,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 94 treesize of output 88 [2022-12-14 15:08:58,276 INFO L321 Elim1Store]: treesize reduction 24, result has 91.3 percent of original size [2022-12-14 15:08:58,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 284 [2022-12-14 15:09:12,677 WARN L233 SmtUtils]: Spent 14.09s on a formula simplification. DAG size of input: 47 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:09:19,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:09:19,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 11115 treesize of output 10555 [2022-12-14 15:10:24,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:10:24,466 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 15:10:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:10:24,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011079756] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:10:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [726293270] [2022-12-14 15:10:24,489 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 15:10:24,490 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:10:24,490 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:10:24,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:10:24,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 35 [2022-12-14 15:10:24,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320537283] [2022-12-14 15:10:24,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:10:24,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 15:10:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:24,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 15:10:24,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1141, Unknown=4, NotChecked=0, Total=1260 [2022-12-14 15:10:24,491 INFO L87 Difference]: Start difference. First operand 300 states and 377 transitions. Second operand has 36 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 32 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:10:29,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:10:39,650 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:10:41,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:10:47,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:10:49,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:10:51,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:10:54,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:10:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:55,909 INFO L93 Difference]: Finished difference Result 448 states and 553 transitions. [2022-12-14 15:10:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 15:10:55,910 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 32 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-12-14 15:10:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:55,912 INFO L225 Difference]: With dead ends: 448 [2022-12-14 15:10:55,912 INFO L226 Difference]: Without dead ends: 448 [2022-12-14 15:10:55,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 58.5s TimeCoverageRelationStatistics Valid=850, Invalid=5150, Unknown=6, NotChecked=0, Total=6006 [2022-12-14 15:10:55,913 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1143 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 425 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:10:55,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1133 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2439 Invalid, 5 Unknown, 0 Unchecked, 16.5s Time] [2022-12-14 15:10:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-12-14 15:10:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 299. [2022-12-14 15:10:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 227 states have (on average 1.2995594713656389) internal successors, (295), 246 states have internal predecessors, (295), 35 states have call successors, (35), 21 states have call predecessors, (35), 24 states have return successors, (46), 31 states have call predecessors, (46), 35 states have call successors, (46) [2022-12-14 15:10:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 376 transitions. [2022-12-14 15:10:55,917 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 376 transitions. Word has length 36 [2022-12-14 15:10:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:55,917 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 376 transitions. [2022-12-14 15:10:55,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 32 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:10:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 376 transitions. [2022-12-14 15:10:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 15:10:55,918 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:55,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:10:55,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 15:10:56,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-14 15:10:56,118 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-12-14 15:10:56,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1290235476, now seen corresponding path program 2 times [2022-12-14 15:10:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:56,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630165832] [2022-12-14 15:10:56,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:10:57,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630165832] [2022-12-14 15:10:57,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630165832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:57,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647542314] [2022-12-14 15:10:57,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:10:57,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:57,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:57,192 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:57,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_497efa35-ca19-49d9-ab0f-27a73dfc620f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 15:10:57,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 15:10:57,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:10:57,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-14 15:10:57,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:57,432 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 [2022-12-14 15:10:57,442 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 [2022-12-14 15:10:57,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:10:57,498 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 21 treesize of output 20 [2022-12-14 15:10:57,522 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-14 15:10:57,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 44 [2022-12-14 15:10:57,543 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:10:57,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2022-12-14 15:10:59,261 INFO L321 Elim1Store]: treesize reduction 34, result has 65.7 percent of original size [2022-12-14 15:10:59,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 154 [2022-12-14 15:10:59,338 INFO L321 Elim1Store]: treesize reduction 28, result has 65.4 percent of original size [2022-12-14 15:10:59,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 140 [2022-12-14 15:11:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 15:11:01,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:11:01,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:11:01,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 130 [2022-12-14 15:11:23,655 WARN L233 SmtUtils]: Spent 12.65s on a formula simplification. DAG size of input: 68 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:11:30,345 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:11:30,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:11:30,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 64 [2022-12-14 15:11:40,561 INFO L321 Elim1Store]: treesize reduction 1111, result has 25.3 percent of original size [2022-12-14 15:11:40,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 162783 treesize of output 150486 [2022-12-14 15:11:41,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3154967 treesize of output 3035639