./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- 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 10:34:36,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:34:36,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:34:36,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:34:36,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:34:36,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:34:36,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:34:36,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:34:36,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:34:36,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:34:36,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:34:36,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:34:36,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:34:36,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:34:36,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:34:36,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:34:36,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:34:36,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:34:36,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:34:36,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:34:36,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:34:36,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:34:36,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:34:36,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:34:36,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:34:36,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:34:36,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:34:36,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:34:36,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:34:36,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:34:36,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:34:36,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:34:36,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:34:36,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:34:36,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:34:36,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:34:36,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:34:36,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:34:36,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:34:36,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:34:36,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:34:36,228 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 10:34:36,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:34:36,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:34:36,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:34:36,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:34:36,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:34:36,249 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:34:36,249 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:34:36,250 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:34:36,250 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:34:36,250 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:34:36,250 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:34:36,250 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:34:36,250 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:34:36,250 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:34:36,251 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:34:36,251 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:34:36,251 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:34:36,251 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:34:36,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:34:36,252 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:34:36,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:34:36,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:34:36,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:34:36,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 10:34:36,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:34:36,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 10:34:36,253 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:34:36,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 10:34:36,253 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:34:36,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 10:34:36,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:34:36,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:34:36,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:34:36,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:34:36,254 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:34:36,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:34:36,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 10:34:36,255 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:34:36,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:34:36,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 10:34:36,255 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:34:36,255 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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/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 ! call(reach_error())) ) 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2022-12-14 10:34:36,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:34:36,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:34:36,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:34:36,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:34:36,467 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:34:36,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-12-14 10:34:39,021 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:34:39,213 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:34:39,214 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-12-14 10:34:39,221 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/data/ef31c6561/f5ad9121eded4eb08e7c13467996da6e/FLAG432f5c486 [2022-12-14 10:34:39,620 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/data/ef31c6561/f5ad9121eded4eb08e7c13467996da6e [2022-12-14 10:34:39,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:34:39,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:34:39,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:34:39,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:34:39,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:34:39,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533efc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39, skipping insertion in model container [2022-12-14 10:34:39,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:34:39,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:34:39,839 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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-12-14 10:34:39,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:34:39,850 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:34:39,874 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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-12-14 10:34:39,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:34:39,892 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:34:39,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39 WrapperNode [2022-12-14 10:34:39,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:34:39,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:34:39,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:34:39,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:34:39,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,920 INFO L138 Inliner]: procedures = 124, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-12-14 10:34:39,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:34:39,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:34:39,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:34:39,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:34:39,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,936 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:34:39,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:34:39,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:34:39,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:34:39,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (1/1) ... [2022-12-14 10:34:39,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:34:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:39,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:34:39,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:34:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 10:34:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:34:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 10:34:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:34:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 10:34:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 10:34:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:34:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:34:39,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:34:40,068 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:34:40,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:34:40,154 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:34:40,173 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:34:40,173 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 10:34:40,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:34:40 BoogieIcfgContainer [2022-12-14 10:34:40,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:34:40,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:34:40,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:34:40,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:34:40,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:34:39" (1/3) ... [2022-12-14 10:34:40,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bd46d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:34:40, skipping insertion in model container [2022-12-14 10:34:40,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:34:39" (2/3) ... [2022-12-14 10:34:40,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bd46d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:34:40, skipping insertion in model container [2022-12-14 10:34:40,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:34:40" (3/3) ... [2022-12-14 10:34:40,181 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2022-12-14 10:34:40,195 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:34:40,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 10:34:40,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:34:40,235 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@691f41b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:34:40,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 10:34:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 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 10:34:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 10:34:40,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:40,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 10:34:40,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 74567963, now seen corresponding path program 1 times [2022-12-14 10:34:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707811967] [2022-12-14 10:34:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:40,353 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 10:34:40,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:40,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707811967] [2022-12-14 10:34:40,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707811967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:34:40,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:34:40,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:34:40,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015344508] [2022-12-14 10:34:40,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:34:40,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 10:34:40,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:40,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 10:34:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 10:34:40,381 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 10:34:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:40,400 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-12-14 10:34:40,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 10:34:40,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-12-14 10:34:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:40,407 INFO L225 Difference]: With dead ends: 17 [2022-12-14 10:34:40,407 INFO L226 Difference]: Without dead ends: 9 [2022-12-14 10:34:40,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 10:34:40,411 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:40,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:34:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-12-14 10:34:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-12-14 10:34:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 10:34:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-12-14 10:34:40,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2022-12-14 10:34:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:40,434 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-12-14 10:34:40,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 10:34:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-12-14 10:34:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:34:40,435 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:40,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 10:34:40,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:34:40,435 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1997841778, now seen corresponding path program 1 times [2022-12-14 10:34:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:40,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928181815] [2022-12-14 10:34:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:40,487 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 10:34:40,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:40,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928181815] [2022-12-14 10:34:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928181815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:34:40,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:34:40,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:34:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037484276] [2022-12-14 10:34:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:34:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:34:40,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:34:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:34:40,491 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 10:34:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:40,505 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-12-14 10:34:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:34:40,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 10:34:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:40,506 INFO L225 Difference]: With dead ends: 18 [2022-12-14 10:34:40,506 INFO L226 Difference]: Without dead ends: 12 [2022-12-14 10:34:40,506 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 10:34:40,508 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:40,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:34:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-14 10:34:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-12-14 10:34:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 10:34:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-12-14 10:34:40,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-12-14 10:34:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:40,512 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-12-14 10:34:40,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 10:34:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-12-14 10:34:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:34:40,513 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:40,513 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:34:40,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:34:40,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:40,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash -106563549, now seen corresponding path program 1 times [2022-12-14 10:34:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:40,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750838786] [2022-12-14 10:34:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:40,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:40,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750838786] [2022-12-14 10:34:40,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750838786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:34:40,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:34:40,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:34:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779729248] [2022-12-14 10:34:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:34:40,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:34:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:40,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:34:40,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:34:40,686 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10:34:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:40,718 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-12-14 10:34:40,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:34:40,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-12-14 10:34:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:40,719 INFO L225 Difference]: With dead ends: 17 [2022-12-14 10:34:40,719 INFO L226 Difference]: Without dead ends: 15 [2022-12-14 10:34:40,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:34:40,721 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:40,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:34:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-14 10:34:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2022-12-14 10:34:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 10:34:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-12-14 10:34:40,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2022-12-14 10:34:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:40,726 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-12-14 10:34:40,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10:34:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-12-14 10:34:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:34:40,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:40,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:34:40,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 10:34:40,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash -649059074, now seen corresponding path program 1 times [2022-12-14 10:34:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:40,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069762895] [2022-12-14 10:34:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:40,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069762895] [2022-12-14 10:34:40,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069762895] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944630301] [2022-12-14 10:34:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:40,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:40,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:40,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:40,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:34:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:41,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 10:34:41,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:34:41,127 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 10:34:41,136 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 10:34:41,217 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 22 treesize of output 10 [2022-12-14 10:34:41,223 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 22 treesize of output 10 [2022-12-14 10:34:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:41,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:34:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:41,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944630301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:34:41,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298896703] [2022-12-14 10:34:41,326 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 10:34:41,327 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:34:41,330 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:34:41,335 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:34:41,336 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:34:41,414 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 10:34:41,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 10:34:41,425 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 10:34:41,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:41,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-12-14 10:34:41,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:41,567 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 10:34:41,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-12-14 10:34:41,584 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 22 treesize of output 30 [2022-12-14 10:34:41,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,665 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 230 treesize of output 218 [2022-12-14 10:34:41,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:41,694 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 10:34:41,694 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 228 treesize of output 227 [2022-12-14 10:34:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,710 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 296 treesize of output 284 [2022-12-14 10:34:41,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:41,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,748 INFO L321 Elim1Store]: treesize reduction 64, result has 24.7 percent of original size [2022-12-14 10:34:41,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 303 treesize of output 289 [2022-12-14 10:34:41,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:41,775 INFO L321 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2022-12-14 10:34:41,775 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 294 treesize of output 293 [2022-12-14 10:34:41,910 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-12-14 10:34:41,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 299 treesize of output 304 [2022-12-14 10:34:41,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:41,982 INFO L321 Elim1Store]: treesize reduction 170, result has 19.4 percent of original size [2022-12-14 10:34:41,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 304 treesize of output 322 [2022-12-14 10:34:42,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:42,037 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 16 treesize of output 17 [2022-12-14 10:34:42,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:42,044 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 16 treesize of output 17 [2022-12-14 10:34:42,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:42,049 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 22 treesize of output 7 [2022-12-14 10:34:42,058 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 10:34:42,063 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 10:34:42,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:42,076 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 16 treesize of output 17 [2022-12-14 10:34:42,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:42,085 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 16 treesize of output 17 [2022-12-14 10:34:42,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:42,090 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 22 treesize of output 7 [2022-12-14 10:34:42,225 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:34:42,472 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '204#(and (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~t~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 10:34:42,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:34:42,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:34:42,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 5 [2022-12-14 10:34:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342687031] [2022-12-14 10:34:42,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:34:42,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:34:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:42,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:34:42,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:34:42,475 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 10:34:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:42,504 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-12-14 10:34:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:34:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 12 [2022-12-14 10:34:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:42,505 INFO L225 Difference]: With dead ends: 26 [2022-12-14 10:34:42,505 INFO L226 Difference]: Without dead ends: 17 [2022-12-14 10:34:42,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:34:42,506 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:42,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:34:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-14 10:34:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-12-14 10:34:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 10:34:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-12-14 10:34:42,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-12-14 10:34:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:42,510 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-12-14 10:34:42,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 10:34:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-12-14 10:34:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:34:42,511 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:42,511 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 10:34:42,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:34:42,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:42,713 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1390509779, now seen corresponding path program 2 times [2022-12-14 10:34:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:42,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189138715] [2022-12-14 10:34:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:43,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189138715] [2022-12-14 10:34:43,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189138715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768911961] [2022-12-14 10:34:43,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:34:43,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:43,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:43,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:43,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:34:43,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:34:43,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:34:43,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 10:34:43,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:34:43,248 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 10:34:43,256 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 14 treesize of output 15 [2022-12-14 10:34:43,271 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:34:43,272 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 10:34:43,289 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 10:34:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:34:43,298 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 10:34:43,347 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 10:34:43,349 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 27 treesize of output 15 [2022-12-14 10:34:43,361 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 10:34:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:43,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:34:43,397 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_100 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) is different from false [2022-12-14 10:34:43,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:43,444 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 23 treesize of output 29 [2022-12-14 10:34:43,449 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 10:34:43,452 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 10:34:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 10:34:43,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768911961] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:34:43,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [901880511] [2022-12-14 10:34:43,466 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 10:34:43,466 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:34:43,466 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:34:43,466 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:34:43,467 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:34:43,505 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 10:34:43,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 10:34:43,513 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 10:34:43,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:43,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:43,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-12-14 10:34:43,593 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 10:34:43,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-12-14 10:34:43,602 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 22 treesize of output 30 [2022-12-14 10:34:43,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,651 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 234 treesize of output 222 [2022-12-14 10:34:43,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,666 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 234 treesize of output 222 [2022-12-14 10:34:43,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:43,689 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 10:34:43,689 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 232 treesize of output 231 [2022-12-14 10:34:43,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:43,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:43,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,723 INFO L321 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2022-12-14 10:34:43,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 271 treesize of output 257 [2022-12-14 10:34:43,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:43,741 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-12-14 10:34:43,741 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 262 treesize of output 261 [2022-12-14 10:34:43,834 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-12-14 10:34:43,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 321 treesize of output 326 [2022-12-14 10:34:43,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,894 INFO L321 Elim1Store]: treesize reduction 170, result has 19.4 percent of original size [2022-12-14 10:34:43,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 326 treesize of output 344 [2022-12-14 10:34:43,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,946 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 16 treesize of output 17 [2022-12-14 10:34:43,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,954 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 16 treesize of output 17 [2022-12-14 10:34:43,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,959 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 22 treesize of output 7 [2022-12-14 10:34:43,969 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 10:34:43,975 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 10:34:43,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,987 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 16 treesize of output 17 [2022-12-14 10:34:43,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:43,996 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 16 treesize of output 17 [2022-12-14 10:34:44,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:44,002 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 22 treesize of output 7 [2022-12-14 10:34:44,118 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:34:44,378 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '362#(and (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~t~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 10:34:44,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:34:44,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:34:44,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-12-14 10:34:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826578250] [2022-12-14 10:34:44,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:34:44,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 10:34:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:44,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 10:34:44,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2022-12-14 10:34:44,381 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 10:34:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:44,593 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-12-14 10:34:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:34:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 15 [2022-12-14 10:34:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:44,594 INFO L225 Difference]: With dead ends: 23 [2022-12-14 10:34:44,594 INFO L226 Difference]: Without dead ends: 21 [2022-12-14 10:34:44,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=473, Unknown=1, NotChecked=46, Total=650 [2022-12-14 10:34:44,595 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:44,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 37 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 6 Unknown, 16 Unchecked, 0.1s Time] [2022-12-14 10:34:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-14 10:34:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-12-14 10:34:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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 10:34:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-12-14 10:34:44,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-12-14 10:34:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:44,600 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-12-14 10:34:44,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 10:34:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-12-14 10:34:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:34:44,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:44,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-12-14 10:34:44,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 10:34:44,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:44,802 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash -277946290, now seen corresponding path program 3 times [2022-12-14 10:34:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:44,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187580574] [2022-12-14 10:34:44,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:45,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:45,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187580574] [2022-12-14 10:34:45,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187580574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:45,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6419096] [2022-12-14 10:34:45,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:34:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:45,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:45,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:45,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 10:34:45,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:34:45,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:34:45,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 10:34:45,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:34:45,220 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 10:34:45,230 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 10:34:45,236 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 10:34:45,257 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:34:45,257 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 10:34:45,269 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:34:45,273 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 16 treesize of output 18 [2022-12-14 10:34:45,279 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 23 [2022-12-14 10:34:45,284 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 8 treesize of output 7 [2022-12-14 10:34:45,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:45,394 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-12-14 10:34:45,394 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-12-14 10:34:45,400 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 10:34:45,401 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 28 treesize of output 18 [2022-12-14 10:34:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:45,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:34:45,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:45,456 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:34:45,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:45,462 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:34:45,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:45,606 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 22 treesize of output 23 [2022-12-14 10:34:45,609 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 36 treesize of output 24 [2022-12-14 10:34:45,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:45,615 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 18 treesize of output 20 [2022-12-14 10:34:45,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:45,639 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 22 treesize of output 23 [2022-12-14 10:34:45,643 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 36 treesize of output 24 [2022-12-14 10:34:45,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:45,650 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 18 treesize of output 20 [2022-12-14 10:34:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:45,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6419096] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:34:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2557307] [2022-12-14 10:34:45,767 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 10:34:45,767 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:34:45,767 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:34:45,768 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:34:45,768 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:34:45,802 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 10:34:45,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 10:34:45,809 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 10:34:45,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:45,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:45,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:45,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:45,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:45,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:45,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-12-14 10:34:45,891 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 10:34:45,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-12-14 10:34:45,901 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 22 treesize of output 30 [2022-12-14 10:34:45,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:45,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:45,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:45,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:45,971 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 10:34:45,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 241 treesize of output 227 [2022-12-14 10:34:45,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:45,986 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 234 treesize of output 222 [2022-12-14 10:34:45,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:46,006 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 10:34:46,006 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 232 treesize of output 231 [2022-12-14 10:34:46,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:46,018 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 264 treesize of output 252 [2022-12-14 10:34:46,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:46,035 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-12-14 10:34:46,036 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 262 treesize of output 261 [2022-12-14 10:34:46,125 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-12-14 10:34:46,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 321 treesize of output 326 [2022-12-14 10:34:46,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:46,182 INFO L321 Elim1Store]: treesize reduction 170, result has 19.4 percent of original size [2022-12-14 10:34:46,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 326 treesize of output 344 [2022-12-14 10:34:46,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:46,214 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 22 treesize of output 7 [2022-12-14 10:34:46,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:46,220 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 16 treesize of output 17 [2022-12-14 10:34:46,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:46,231 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 16 treesize of output 17 [2022-12-14 10:34:46,238 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 10:34:46,243 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 10:34:46,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:46,250 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 22 treesize of output 7 [2022-12-14 10:34:46,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:46,256 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 16 treesize of output 17 [2022-12-14 10:34:46,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:46,263 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 16 treesize of output 17 [2022-12-14 10:34:46,330 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:34:46,595 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '554#(and (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~t~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 10:34:46,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:34:46,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:34:46,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-14 10:34:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030896304] [2022-12-14 10:34:46,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:34:46,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:34:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:46,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:34:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=317, Unknown=6, NotChecked=0, Total=380 [2022-12-14 10:34:46,598 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 10:34:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:46,709 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-12-14 10:34:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:34:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 18 [2022-12-14 10:34:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:46,710 INFO L225 Difference]: With dead ends: 35 [2022-12-14 10:34:46,710 INFO L226 Difference]: Without dead ends: 23 [2022-12-14 10:34:46,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=349, Unknown=6, NotChecked=0, Total=420 [2022-12-14 10:34:46,710 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:46,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 80 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:34:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-14 10:34:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-12-14 10:34:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 10:34:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-12-14 10:34:46,713 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2022-12-14 10:34:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:46,713 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-12-14 10:34:46,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 10:34:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-12-14 10:34:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:34:46,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:46,714 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-12-14 10:34:46,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 10:34:46,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 10:34:46,915 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1181271651, now seen corresponding path program 4 times [2022-12-14 10:34:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:46,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297467632] [2022-12-14 10:34:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:47,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297467632] [2022-12-14 10:34:47,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297467632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950369543] [2022-12-14 10:34:47,448 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:34:47,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:47,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:47,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:47,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 10:34:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:47,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 10:34:47,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:34:47,513 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 10:34:47,517 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 14 treesize of output 15 [2022-12-14 10:34:47,536 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:34:47,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:34:47,564 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 10:34:47,566 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 10:34:47,571 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 10:34:47,609 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-14 10:34:47,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 10:34:47,647 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:34:47,651 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 42 treesize of output 36 [2022-12-14 10:34:47,656 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 23 [2022-12-14 10:34:47,666 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 8 treesize of output 7 [2022-12-14 10:34:47,672 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 22 treesize of output 24 [2022-12-14 10:34:47,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:47,816 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-12-14 10:34:47,816 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 49 [2022-12-14 10:34:47,822 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 10:34:47,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-12-14 10:34:47,833 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 10:34:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:47,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:34:47,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:47,891 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-12-14 10:34:47,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:47,895 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-12-14 10:34:47,905 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_8 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_9 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))) 1)))) is different from false [2022-12-14 10:34:47,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:47,959 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 51 treesize of output 52 [2022-12-14 10:34:47,964 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 10:34:47,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:47,973 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 47 treesize of output 49 [2022-12-14 10:34:47,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:47,979 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 74 treesize of output 64 [2022-12-14 10:34:47,983 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 112 treesize of output 94 [2022-12-14 10:34:47,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:47,991 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 96 treesize of output 94 [2022-12-14 10:34:48,190 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 10:34:48,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:48,772 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 26 treesize of output 32 [2022-12-14 10:34:48,776 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 122 treesize of output 110 [2022-12-14 10:34:48,782 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 90 treesize of output 86 [2022-12-14 10:34:48,785 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 86 treesize of output 78 [2022-12-14 10:34:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:34:48,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950369543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:34:48,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [489744946] [2022-12-14 10:34:48,859 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 10:34:48,859 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:34:48,860 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:34:48,860 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:34:48,860 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:34:48,891 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 10:34:48,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 10:34:48,919 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 10:34:48,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 10:34:48,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:48,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:48,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:48,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:48,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:48,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-12-14 10:34:48,999 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 10:34:49,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-12-14 10:34:49,009 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 22 treesize of output 30 [2022-12-14 10:34:49,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,048 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 230 treesize of output 218 [2022-12-14 10:34:49,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,061 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 230 treesize of output 218 [2022-12-14 10:34:49,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:49,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,093 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 10:34:49,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 223 [2022-12-14 10:34:49,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:49,112 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 10:34:49,113 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 228 treesize of output 227 [2022-12-14 10:34:49,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:49,130 INFO L321 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2022-12-14 10:34:49,131 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 294 treesize of output 293 [2022-12-14 10:34:49,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,245 INFO L321 Elim1Store]: treesize reduction 162, result has 23.2 percent of original size [2022-12-14 10:34:49,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 304 treesize of output 330 [2022-12-14 10:34:49,261 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-12-14 10:34:49,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 299 treesize of output 304 [2022-12-14 10:34:49,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,299 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 16 treesize of output 17 [2022-12-14 10:34:49,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,304 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 22 treesize of output 7 [2022-12-14 10:34:49,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,311 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 16 treesize of output 17 [2022-12-14 10:34:49,319 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 10:34:49,323 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 10:34:49,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,335 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 16 treesize of output 17 [2022-12-14 10:34:49,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,341 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 16 treesize of output 17 [2022-12-14 10:34:49,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:49,346 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 22 treesize of output 7 [2022-12-14 10:34:49,429 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:34:49,755 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '782#(and (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~t~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 10:34:49,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:34:49,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:34:49,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-12-14 10:34:49,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904197516] [2022-12-14 10:34:49,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:34:49,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 10:34:49,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:49,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 10:34:49,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=768, Unknown=2, NotChecked=56, Total=930 [2022-12-14 10:34:49,758 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 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 10:34:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:50,209 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-12-14 10:34:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:34:50,209 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 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 21 [2022-12-14 10:34:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:50,210 INFO L225 Difference]: With dead ends: 29 [2022-12-14 10:34:50,210 INFO L226 Difference]: Without dead ends: 27 [2022-12-14 10:34:50,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=270, Invalid=1292, Unknown=2, NotChecked=76, Total=1640 [2022-12-14 10:34:50,211 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:50,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 73 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-12-14 10:34:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-14 10:34:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-12-14 10:34:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 10:34:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-12-14 10:34:50,216 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2022-12-14 10:34:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:50,216 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-12-14 10:34:50,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 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 10:34:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-12-14 10:34:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:34:50,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:50,217 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-14 10:34:50,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 10:34:50,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:50,419 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1693471042, now seen corresponding path program 5 times [2022-12-14 10:34:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:50,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963393485] [2022-12-14 10:34:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:51,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:51,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963393485] [2022-12-14 10:34:51,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963393485] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:51,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27359094] [2022-12-14 10:34:51,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:34:51,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:51,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:51,037 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:51,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 10:34:51,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 10:34:51,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:34:51,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-14 10:34:51,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:34:51,129 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 10:34:51,138 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 10:34:51,141 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 10:34:51,162 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:34:51,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:34:51,182 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:34:51,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 10:34:51,187 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 8 treesize of output 7 [2022-12-14 10:34:51,192 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 16 treesize of output 18 [2022-12-14 10:34:51,246 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-14 10:34:51,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 10:34:51,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:34:51,298 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 32 treesize of output 37 [2022-12-14 10:34:51,308 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-14 10:34:51,308 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 55 treesize of output 51 [2022-12-14 10:34:51,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 10:34:51,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:51,576 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-12-14 10:34:51,576 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 82 [2022-12-14 10:34:51,588 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-12-14 10:34:51,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-12-14 10:34:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:51,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:34:51,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:51,683 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-12-14 10:34:51,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:51,687 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2022-12-14 10:34:51,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:51,695 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-12-14 10:34:51,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:51,699 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-12-14 10:34:51,711 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_17 .cse0))) (= (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_18))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (+ (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) 4))) 0) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_18 .cse0))))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_15 .cse0))) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_15))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) 0) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_16 .cse0))))))) is different from false [2022-12-14 10:34:51,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:51,834 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-14 10:34:51,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:51,840 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-12-14 10:34:51,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:51,861 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-14 10:34:51,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:51,870 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-12-14 10:34:52,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:52,155 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 75 treesize of output 66 [2022-12-14 10:34:52,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:52,163 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 55 treesize of output 56 [2022-12-14 10:34:52,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:52,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,172 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 152 [2022-12-14 10:34:52,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:52,178 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 86 treesize of output 80 [2022-12-14 10:34:52,182 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 82 treesize of output 68 [2022-12-14 10:34:52,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:52,191 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 70 treesize of output 66 [2022-12-14 10:34:52,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:52,200 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-12-14 10:34:52,204 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 65 treesize of output 57 [2022-12-14 10:34:52,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:52,282 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 75 treesize of output 76 [2022-12-14 10:34:52,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:52,289 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 65 treesize of output 56 [2022-12-14 10:34:52,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:52,299 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 38 [2022-12-14 10:34:52,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:52,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,305 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 178 [2022-12-14 10:34:52,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:52,315 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 180 treesize of output 148 [2022-12-14 10:34:52,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:52,324 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 153 treesize of output 119 [2022-12-14 10:34:52,330 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 27 treesize of output 21 [2022-12-14 10:34:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:34:52,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27359094] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:34:52,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [365604602] [2022-12-14 10:34:52,688 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 10:34:52,688 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:34:52,688 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:34:52,688 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:34:52,688 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:34:52,721 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 10:34:52,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 10:34:52,727 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 10:34:52,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:52,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-12-14 10:34:52,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:34:52,793 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-12-14 10:34:52,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-12-14 10:34:52,829 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 10:34:52,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-12-14 10:34:52,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:52,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,905 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 10:34:52,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 223 [2022-12-14 10:34:52,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,918 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 230 treesize of output 218 [2022-12-14 10:34:52,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:52,936 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 10:34:52,936 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 228 treesize of output 227 [2022-12-14 10:34:52,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:52,943 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 296 treesize of output 284 [2022-12-14 10:34:52,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:34:52,956 INFO L321 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2022-12-14 10:34:52,956 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 294 treesize of output 293 [2022-12-14 10:34:53,062 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-12-14 10:34:53,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 299 treesize of output 304 [2022-12-14 10:34:53,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:53,119 INFO L321 Elim1Store]: treesize reduction 170, result has 19.4 percent of original size [2022-12-14 10:34:53,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 304 treesize of output 322 [2022-12-14 10:34:53,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:53,162 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 22 treesize of output 7 [2022-12-14 10:34:53,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:53,167 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 16 treesize of output 17 [2022-12-14 10:34:53,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:53,173 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 16 treesize of output 17 [2022-12-14 10:34:53,181 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 10:34:53,184 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 10:34:53,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:53,190 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 22 treesize of output 7 [2022-12-14 10:34:53,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:53,196 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 16 treesize of output 17 [2022-12-14 10:34:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:53,201 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 16 treesize of output 17 [2022-12-14 10:34:53,276 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:34:53,531 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1042#(and (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 10:34:53,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:34:53,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:34:53,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-12-14 10:34:53,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586807349] [2022-12-14 10:34:53,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:34:53,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 10:34:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:53,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 10:34:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=615, Unknown=3, NotChecked=50, Total=756 [2022-12-14 10:34:53,533 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:34:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:57,984 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-12-14 10:34:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 10:34:57,985 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 10:34:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:57,985 INFO L225 Difference]: With dead ends: 44 [2022-12-14 10:34:57,985 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 10:34:57,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=97, Invalid=660, Unknown=3, NotChecked=52, Total=812 [2022-12-14 10:34:57,986 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:57,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 129 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 1 Unknown, 22 Unchecked, 0.2s Time] [2022-12-14 10:34:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 10:34:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-12-14 10:34:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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 10:34:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-12-14 10:34:57,989 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2022-12-14 10:34:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:57,989 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-12-14 10:34:57,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:34:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-12-14 10:34:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:34:57,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:57,990 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-12-14 10:34:57,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 10:34:58,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:58,191 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:34:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1130885395, now seen corresponding path program 6 times [2022-12-14 10:34:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598713775] [2022-12-14 10:34:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:59,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:59,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598713775] [2022-12-14 10:34:59,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598713775] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:59,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899096443] [2022-12-14 10:34:59,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:34:59,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:59,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:59,266 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:59,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 10:34:59,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:34:59,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:34:59,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-14 10:34:59,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:34:59,340 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 10:34:59,346 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 14 treesize of output 15 [2022-12-14 10:34:59,367 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:34:59,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:34:59,407 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 10:34:59,410 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 10:34:59,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 10:34:59,482 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-12-14 10:34:59,482 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 4 case distinctions, treesize of input 26 treesize of output 41 [2022-12-14 10:34:59,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:34:59,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 10:34:59,550 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 19 treesize of output 21 [2022-12-14 10:34:59,553 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 53 treesize of output 43 [2022-12-14 10:34:59,565 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 8 treesize of output 7 [2022-12-14 10:34:59,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:59,642 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-12-14 10:34:59,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-12-14 10:34:59,698 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:34:59,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 10:34:59,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:59,708 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 32 treesize of output 37 [2022-12-14 10:34:59,710 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 8 treesize of output 7 [2022-12-14 10:34:59,721 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-14 10:34:59,721 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 97 treesize of output 69 [2022-12-14 10:35:00,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:35:00,087 INFO L321 Elim1Store]: treesize reduction 79, result has 19.4 percent of original size [2022-12-14 10:35:00,088 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 180 treesize of output 98 [2022-12-14 10:35:00,101 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-12-14 10:35:00,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-12-14 10:35:00,118 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 10:35:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:35:00,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:35:00,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,216 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 88 [2022-12-14 10:35:00,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,220 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 73 [2022-12-14 10:35:00,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_29 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (or (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_30)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_29)) (.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)) (.cse2 (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_485) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_30 .cse5))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_29 .cse5)))))) is different from false [2022-12-14 10:35:00,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,312 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 117 [2022-12-14 10:35:00,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,318 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 102 [2022-12-14 10:35:00,461 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_37| Int) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_arrayElimArr_31 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_30 4))) (let ((.cse0 (select v_arrayElimArr_29 4)) (.cse6 (+ .cse1 4))) (or (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~t~0#1.base_37|) 0)) (not (= .cse1 0)) (not (= (select |c_#valid| .cse0) 0)) (= (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_31) |v_ULTIMATE.start_main_~t~0#1.base_37| v_arrayElimArr_30)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_32) |v_ULTIMATE.start_main_~t~0#1.base_37| v_arrayElimArr_29))) (let ((.cse3 (select (select .cse2 .cse0) .cse6)) (.cse4 (+ (select (select .cse5 .cse0) .cse6) 4))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_474) |v_ULTIMATE.start_main_~t~0#1.base_37| v_ArrVal_485) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))) 1) (not (= (select v_arrayElimArr_32 .cse6) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_31 .cse6))))))) is different from false [2022-12-14 10:35:00,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,505 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 178 treesize of output 159 [2022-12-14 10:35:00,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,514 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 148 treesize of output 129 [2022-12-14 10:35:00,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:35:00,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:35:00,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 820 treesize of output 754 [2022-12-14 10:35:00,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,537 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 769 treesize of output 617 [2022-12-14 10:35:00,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:35:00,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:35:00,549 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1682 treesize of output 1532 [2022-12-14 10:35:00,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,569 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1538 treesize of output 1320 [2022-12-14 10:35:00,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,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 1300 treesize of output 900 [2022-12-14 10:35:00,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:35:00,613 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 912 treesize of output 850 [2022-12-14 10:39:26,696 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-14 10:39:26,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-14 10:39:26,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-12-14 10:39:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1485833399] [2022-12-14 10:39:26,699 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 10:39:26,699 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:39:26,699 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:39:26,699 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:39:26,699 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:39:26,702 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) 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) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-12-14 10:39:26,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:39:26,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-12-14 10:39:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973622890] [2022-12-14 10:39:26,704 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-14 10:39:26,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 10:39:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:26,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 10:39:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=878, Unknown=3, NotChecked=122, Total=1122 [2022-12-14 10:39:26,705 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 10:39:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 10:39:26,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=878, Unknown=3, NotChecked=122, Total=1122 [2022-12-14 10:39:26,706 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:26,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:39:26,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 10:39:26,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:39:26,908 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5b8f9ac4 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) 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 10:39:26,914 INFO L158 Benchmark]: Toolchain (without parser) took 287287.22ms. Allocated memory was 119.5MB in the beginning and 302.0MB in the end (delta: 182.5MB). Free memory was 83.6MB in the beginning and 231.8MB in the end (delta: -148.2MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2022-12-14 10:39:26,914 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 98.6MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:39:26,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.73ms. Allocated memory is still 119.5MB. Free memory was 83.3MB in the beginning and 66.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 10:39:26,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.95ms. Allocated memory is still 119.5MB. Free memory was 66.9MB in the beginning and 65.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:39:26,916 INFO L158 Benchmark]: Boogie Preprocessor took 17.32ms. Allocated memory is still 119.5MB. Free memory was 65.0MB in the beginning and 63.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:39:26,916 INFO L158 Benchmark]: RCFGBuilder took 236.57ms. Allocated memory is still 119.5MB. Free memory was 63.7MB in the beginning and 91.2MB in the end (delta: -27.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-12-14 10:39:26,917 INFO L158 Benchmark]: TraceAbstraction took 286736.37ms. Allocated memory was 119.5MB in the beginning and 302.0MB in the end (delta: 182.5MB). Free memory was 90.0MB in the beginning and 231.8MB in the end (delta: -141.8MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2022-12-14 10:39:26,920 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 98.6MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.73ms. Allocated memory is still 119.5MB. Free memory was 83.3MB in the beginning and 66.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.95ms. Allocated memory is still 119.5MB. Free memory was 66.9MB in the beginning and 65.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.32ms. Allocated memory is still 119.5MB. Free memory was 65.0MB in the beginning and 63.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 236.57ms. Allocated memory is still 119.5MB. Free memory was 63.7MB in the beginning and 91.2MB in the end (delta: -27.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 286736.37ms. Allocated memory was 119.5MB in the beginning and 302.0MB in the end (delta: 182.5MB). Free memory was 90.0MB in the beginning and 231.8MB in the end (delta: -141.8MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5b8f9ac4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5b8f9ac4: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- 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 10:39:28,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:39:28,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:39:28,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:39:28,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:39:28,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:39:28,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:39:28,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:39:28,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:39:28,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:39:28,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:39:28,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:39:28,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:39:28,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:39:28,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:39:28,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:39:28,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:39:28,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:39:28,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:39:28,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:39:28,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:39:28,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:39:28,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:39:28,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:39:28,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:39:28,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:39:28,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:39:28,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:39:28,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:39:28,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:39:28,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:39:28,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:39:28,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:39:28,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:39:28,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:39:28,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:39:28,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:39:28,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:39:28,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:39:28,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:39:28,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:39:28,285 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 10:39:28,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:39:28,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:39:28,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:39:28,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:39:28,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:39:28,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:39:28,303 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:39:28,303 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:39:28,303 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:39:28,303 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:39:28,304 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:39:28,304 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:39:28,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:39:28,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:39:28,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:39:28,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:39:28,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 10:39:28,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:39:28,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 10:39:28,306 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 10:39:28,306 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 10:39:28,306 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 10:39:28,306 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:39:28,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 10:39:28,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:39:28,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 10:39:28,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:39:28,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 10:39:28,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:39:28,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:39:28,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:39:28,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:39:28,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 10:39:28,308 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 10:39:28,309 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 10:39:28,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 10:39:28,309 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:39:28,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 10:39:28,309 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/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 ! call(reach_error())) ) 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2022-12-14 10:39:28,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:39:28,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:39:28,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:39:28,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:39:28,537 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:39:28,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-12-14 10:39:31,073 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:39:31,244 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:39:31,244 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/sv-benchmarks/c/list-properties/simple_built_from_end.i [2022-12-14 10:39:31,253 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/data/3f8471f0e/c1855d0df5f148ac9f98c7e31b9492f2/FLAG84eb5fe96 [2022-12-14 10:39:31,264 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/data/3f8471f0e/c1855d0df5f148ac9f98c7e31b9492f2 [2022-12-14 10:39:31,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:39:31,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:39:31,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:39:31,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:39:31,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:39:31,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794356ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31, skipping insertion in model container [2022-12-14 10:39:31,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:39:31,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:39:31,486 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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-12-14 10:39:31,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:39:31,500 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:39:31,526 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_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2022-12-14 10:39:31,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:39:31,546 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:39:31,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31 WrapperNode [2022-12-14 10:39:31,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:39:31,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:39:31,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:39:31,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:39:31,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,576 INFO L138 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-12-14 10:39:31,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:39:31,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:39:31,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:39:31,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:39:31,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,596 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:39:31,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:39:31,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:39:31,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:39:31,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (1/1) ... [2022-12-14 10:39:31,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:39:31,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:39:31,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:39:31,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:39:31,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 10:39:31,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 10:39:31,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:39:31,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 10:39:31,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 10:39:31,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 10:39:31,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 10:39:31,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:39:31,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:39:31,749 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:39:31,751 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:39:31,851 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:39:31,856 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:39:31,856 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 10:39:31,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:39:31 BoogieIcfgContainer [2022-12-14 10:39:31,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:39:31,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:39:31,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:39:31,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:39:31,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:39:31" (1/3) ... [2022-12-14 10:39:31,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef9dbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:39:31, skipping insertion in model container [2022-12-14 10:39:31,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:31" (2/3) ... [2022-12-14 10:39:31,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef9dbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:39:31, skipping insertion in model container [2022-12-14 10:39:31,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:39:31" (3/3) ... [2022-12-14 10:39:31,868 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2022-12-14 10:39:31,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:39:31,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 10:39:31,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:39:31,938 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@183132cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:39:31,938 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 10:39:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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 10:39:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:39:31,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:31,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 10:39:31,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:39:31,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash 890006222, now seen corresponding path program 1 times [2022-12-14 10:39:31,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 10:39:31,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316721982] [2022-12-14 10:39:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:31,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:31,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 10:39:31,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 10:39:31,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 10:39:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:32,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 10:39:32,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:32,063 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 10:39:32,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:39:32,064 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 10:39:32,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316721982] [2022-12-14 10:39:32,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316721982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:32,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:32,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:32,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899805245] [2022-12-14 10:39:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 10:39:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 10:39:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 10:39:32,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 10:39:32,094 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 10:39:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:32,104 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-12-14 10:39:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 10:39:32,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 10:39:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:32,111 INFO L225 Difference]: With dead ends: 22 [2022-12-14 10:39:32,111 INFO L226 Difference]: Without dead ends: 10 [2022-12-14 10:39:32,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 10:39:32,115 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:32,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:39:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-12-14 10:39:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-12-14 10:39:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 10:39:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-12-14 10:39:32,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-12-14 10:39:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:32,137 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-12-14 10:39:32,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 10:39:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-12-14 10:39:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:39:32,137 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:32,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 10:39:32,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:39:32,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:32,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:39:32,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:32,340 INFO L85 PathProgramCache]: Analyzing trace with hash 889648730, now seen corresponding path program 1 times [2022-12-14 10:39:32,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 10:39:32,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494922345] [2022-12-14 10:39:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:32,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:32,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 10:39:32,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 10:39:32,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 10:39:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:32,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 10:39:32,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:32,412 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 10:39:32,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:39:32,413 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 10:39:32,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494922345] [2022-12-14 10:39:32,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494922345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:32,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:32,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:39:32,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90192968] [2022-12-14 10:39:32,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:32,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:32,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 10:39:32,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:32,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:32,416 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 3 states, 3 states have (on average 2.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 10:39:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:32,456 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-12-14 10:39:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:32,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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 10:39:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:32,457 INFO L225 Difference]: With dead ends: 19 [2022-12-14 10:39:32,457 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 10:39:32,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 10:39:32,459 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:32,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:39:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 10:39:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2022-12-14 10:39:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 10:39:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-12-14 10:39:32,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-12-14 10:39:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:32,469 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-12-14 10:39:32,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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 10:39:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-12-14 10:39:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:39:32,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:32,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:32,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 10:39:32,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:32,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:39:32,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash 671286241, now seen corresponding path program 1 times [2022-12-14 10:39:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 10:39:32,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467866731] [2022-12-14 10:39:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:32,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:32,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 10:39:32,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 10:39:32,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 10:39:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:32,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 10:39:32,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:32,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 16 treesize of output 17 [2022-12-14 10:39:32,862 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 10:39:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:32,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:39:32,871 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 10:39:32,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467866731] [2022-12-14 10:39:32,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467866731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:32,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:32,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:39:32,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410122236] [2022-12-14 10:39:32,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:32,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:39:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 10:39:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:39:32,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:39:32,873 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10:39:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:32,938 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-12-14 10:39:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:39:32,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-12-14 10:39:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:32,939 INFO L225 Difference]: With dead ends: 18 [2022-12-14 10:39:32,939 INFO L226 Difference]: Without dead ends: 16 [2022-12-14 10:39:32,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 10:39:32,940 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:32,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:39:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-14 10:39:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2022-12-14 10:39:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 10:39:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-12-14 10:39:32,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2022-12-14 10:39:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:32,943 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-12-14 10:39:32,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10:39:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-12-14 10:39:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:39:32,944 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:32,944 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:32,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 10:39:33,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:33,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:39:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash 925471903, now seen corresponding path program 1 times [2022-12-14 10:39:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 10:39:33,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642671427] [2022-12-14 10:39:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:33,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 10:39:33,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 10:39:33,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 10:39:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:33,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 10:39:33,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:33,330 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 10:39:33,338 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 10:39:33,395 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 10:39:33,398 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 10:39:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:33,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:33,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 10:39:33,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642671427] [2022-12-14 10:39:33,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642671427] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:33,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1092653774] [2022-12-14 10:39:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:33,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 10:39:33,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 10:39:33,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 10:39:33,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-12-14 10:39:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:33,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 10:39:33,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:33,575 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 10:39:33,582 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 10:39:33,628 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 10:39:33,631 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 10:39:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:33,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:33,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1092653774] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:33,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6827736] [2022-12-14 10:39:33,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:39:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:39:33,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:39:33,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 10:39:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:33,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 10:39:33,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:33,765 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 10:39:33,770 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 10:39:33,804 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 10:39:33,807 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 10:39:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:33,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:33,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6827736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:33,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 10:39:33,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5, 4, 5, 4] total 6 [2022-12-14 10:39:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389209857] [2022-12-14 10:39:33,852 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 10:39:33,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:39:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 10:39:33,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:39:33,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:39:33,853 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 10:39:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:33,969 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-12-14 10:39:33,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:39:33,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 12 [2022-12-14 10:39:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:33,970 INFO L225 Difference]: With dead ends: 27 [2022-12-14 10:39:33,970 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 10:39:33,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:39:33,972 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:33,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:39:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 10:39:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-12-14 10:39:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 10:39:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-12-14 10:39:33,978 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-12-14 10:39:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:33,979 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-12-14 10:39:33,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 10:39:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-12-14 10:39:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:39:33,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:33,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:33,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2022-12-14 10:39:34,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 10:39:34,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-12-14 10:39:34,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:34,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:39:34,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1819205402, now seen corresponding path program 2 times [2022-12-14 10:39:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 10:39:34,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995961260] [2022-12-14 10:39:34,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 10:39:34,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:34,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 10:39:34,586 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 10:39:34,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 10:39:34,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 10:39:34,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:39:34,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 10:39:34,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:34,693 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 14 treesize of output 15 [2022-12-14 10:39:34,744 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 10:39:34,766 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:39:34,766 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 10:39:34,771 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 10:39:34,889 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 10:39:34,892 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 11 [2022-12-14 10:39:34,912 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 10:39:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:34,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:35,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_100 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (or (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~t~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32)) (not (= (select v_ArrVal_100 |c_ULTIMATE.start_main_~t~0#1.offset|) (_ bv1 32))))) is different from false [2022-12-14 10:39:35,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:35,154 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 23 treesize of output 29 [2022-12-14 10:39:35,159 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 10:39:35,168 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 10:39:35,168 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 10:39:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:39:35,176 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 10:39:35,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995961260] [2022-12-14 10:39:35,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995961260] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:35,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1459571343] [2022-12-14 10:39:35,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 10:39:35,177 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 10:39:35,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 10:39:35,178 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 10:39:35,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-12-14 10:39:35,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 10:39:35,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:39:35,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 10:39:35,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:35,294 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 7 [2022-12-14 10:39:35,331 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 14 treesize of output 15 [2022-12-14 10:39:35,379 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 10:39:35,379 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 13 treesize of output 13 [2022-12-14 10:39:35,429 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 10:39:35,437 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 10:39:35,442 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 18 treesize of output 20 [2022-12-14 10:39:35,516 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 10:39:35,520 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 27 treesize of output 15 [2022-12-14 10:39:35,527 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 10:39:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:35,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:38,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:38,193 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 23 treesize of output 29 [2022-12-14 10:39:38,196 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 10:39:38,202 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 10:39:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:38,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1459571343] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:38,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089694840] [2022-12-14 10:39:38,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 10:39:38,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:39:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:39:38,229 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:39:38,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 10:39:38,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 10:39:38,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:39:38,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 10:39:38,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:38,293 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 7 [2022-12-14 10:39:38,325 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 16 treesize of output 17 [2022-12-14 10:39:40,376 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 10:39:40,376 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 12 [2022-12-14 10:39:40,429 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 10:39:40,436 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 18 treesize of output 20 [2022-12-14 10:39:40,442 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 10:39:40,512 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 19 [2022-12-14 10:39:40,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 11 [2022-12-14 10:39:40,523 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 10:39:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:40,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:41,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:41,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-12-14 10:39:41,553 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 10:39:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:41,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089694840] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:41,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 10:39:41,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8, 8, 8, 8] total 25 [2022-12-14 10:39:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255863759] [2022-12-14 10:39:41,559 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 10:39:41,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 10:39:41,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 10:39:41,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 10:39:41,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=442, Unknown=21, NotChecked=44, Total=600 [2022-12-14 10:39:41,561 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 10:39:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:42,039 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-12-14 10:39:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:39:42,039 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 15 [2022-12-14 10:39:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:42,040 INFO L225 Difference]: With dead ends: 24 [2022-12-14 10:39:42,040 INFO L226 Difference]: Without dead ends: 22 [2022-12-14 10:39:42,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=215, Invalid=698, Unknown=21, NotChecked=58, Total=992 [2022-12-14 10:39:42,041 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:42,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 40 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 16 Unchecked, 0.2s Time] [2022-12-14 10:39:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-12-14 10:39:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-12-14 10:39:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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 10:39:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-12-14 10:39:42,044 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-12-14 10:39:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:42,044 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-12-14 10:39:42,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 10:39:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-12-14 10:39:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:39:42,044 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:42,045 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-14 10:39:42,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-12-14 10:39:42,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 10:39:42,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 10:39:42,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:39:42,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:39:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2045993606, now seen corresponding path program 3 times [2022-12-14 10:39:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 10:39:42,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225775782] [2022-12-14 10:39:42,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:39:42,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:42,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 10:39:42,654 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 10:39:42,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 10:39:42,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:39:42,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:39:42,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 10:39:42,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:42,749 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 7 [2022-12-14 10:39:42,777 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 10:39:42,782 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 10:39:42,808 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 10:39:42,808 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 13 treesize of output 13 [2022-12-14 10:39:42,846 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:39:42,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 10:39:42,853 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 8 treesize of output 7 [2022-12-14 10:39:42,858 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 16 treesize of output 18 [2022-12-14 10:39:42,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:39:42,988 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-12-14 10:39:42,988 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-12-14 10:39:42,997 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 10:39:42,997 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 28 treesize of output 18 [2022-12-14 10:39:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:43,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:43,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:43,093 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:39:43,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:43,103 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:39:43,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:43,461 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 22 treesize of output 23 [2022-12-14 10:39:43,467 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 36 treesize of output 24 [2022-12-14 10:39:43,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:43,479 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 18 treesize of output 20 [2022-12-14 10:39:43,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:43,519 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 22 treesize of output 23 [2022-12-14 10:39:43,525 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 36 treesize of output 24 [2022-12-14 10:39:43,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:43,538 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 18 treesize of output 20 [2022-12-14 10:39:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:44,042 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 10:39:44,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225775782] [2022-12-14 10:39:44,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225775782] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:44,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2018417154] [2022-12-14 10:39:44,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:39:44,043 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 10:39:44,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 10:39:44,044 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 10:39:44,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-12-14 10:39:44,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:39:44,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:39:44,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 10:39:44,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:44,186 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 7 [2022-12-14 10:39:44,202 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 10:39:44,210 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 10:39:44,228 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 10:39:44,228 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 13 treesize of output 13 [2022-12-14 10:39:44,283 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-12-14 10:39:44,288 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-12-14 10:39:44,292 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 18 treesize of output 20 [2022-12-14 10:39:44,297 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 18 treesize of output 20 [2022-12-14 10:39:44,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:39:44,577 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-12-14 10:39:44,578 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 39 [2022-12-14 10:39:44,588 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 10:39:44,588 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 32 treesize of output 18 [2022-12-14 10:39:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:44,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:44,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:44,639 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:39:44,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:44,650 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:39:48,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:48,279 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 22 treesize of output 23 [2022-12-14 10:39:48,290 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 36 treesize of output 24 [2022-12-14 10:39:48,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:48,311 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 20 treesize of output 20 [2022-12-14 10:39:48,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:48,343 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 22 treesize of output 23 [2022-12-14 10:39:48,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:39:48,350 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 20 treesize of output 8 [2022-12-14 10:39:48,363 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 10:39:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:52,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2018417154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:52,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746082440] [2022-12-14 10:39:52,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:39:52,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:39:52,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:39:52,498 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:39:52,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 10:39:52,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:39:52,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:39:52,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 10:39:52,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:52,602 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 7 [2022-12-14 10:39:52,627 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 10:39:52,640 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 10:39:52,672 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 10:39:52,673 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 13 treesize of output 13 [2022-12-14 10:39:52,724 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:39:52,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 10:39:52,736 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 8 treesize of output 7 [2022-12-14 10:39:52,748 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 16 treesize of output 18 [2022-12-14 10:39:52,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:39:53,000 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-12-14 10:39:53,000 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-12-14 10:39:53,017 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 10:39:53,017 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 28 treesize of output 18 [2022-12-14 10:39:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:53,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:53,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:53,122 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:39:53,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:53,144 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:39:53,165 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_16 .cse1))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_17 .cse1))))))) is different from false [2022-12-14 10:39:53,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:53,373 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 22 treesize of output 23 [2022-12-14 10:39:53,379 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 36 treesize of output 24 [2022-12-14 10:39:53,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:53,396 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 18 treesize of output 20 [2022-12-14 10:39:53,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:53,450 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 22 treesize of output 23 [2022-12-14 10:39:53,460 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 36 treesize of output 24 [2022-12-14 10:39:53,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:53,483 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 18 treesize of output 20 [2022-12-14 10:39:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:39:53,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746082440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:53,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 10:39:53,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 20 [2022-12-14 10:39:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035830342] [2022-12-14 10:39:53,756 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 10:39:53,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 10:39:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 10:39:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 10:39:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=271, Unknown=17, NotChecked=34, Total=380 [2022-12-14 10:39:53,757 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 10:39:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:54,840 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-12-14 10:39:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:39:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 18 [2022-12-14 10:39:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:54,841 INFO L225 Difference]: With dead ends: 36 [2022-12-14 10:39:54,841 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 10:39:54,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=68, Invalid=299, Unknown=17, NotChecked=36, Total=420 [2022-12-14 10:39:54,841 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:54,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 20 Unchecked, 0.9s Time] [2022-12-14 10:39:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 10:39:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-12-14 10:39:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 10:39:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-12-14 10:39:54,845 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2022-12-14 10:39:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:54,845 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-12-14 10:39:54,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 10:39:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-12-14 10:39:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:39:54,845 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:54,845 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-12-14 10:39:54,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 10:39:55,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2022-12-14 10:39:55,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-12-14 10:39:55,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:55,448 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:39:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1299552385, now seen corresponding path program 4 times [2022-12-14 10:39:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 10:39:55,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215657078] [2022-12-14 10:39:55,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:39:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:39:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 10:39:55,452 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 10:39:55,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-14 10:39:55,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:39:55,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:39:55,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 10:39:55,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:55,574 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 7 [2022-12-14 10:39:55,600 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 14 treesize of output 15 [2022-12-14 10:39:55,666 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 10:39:55,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 10:39:55,748 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 10:39:55,755 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 18 treesize of output 20 [2022-12-14 10:39:55,777 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 10:39:55,842 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 10:39:55,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 17 [2022-12-14 10:39:55,955 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:39:56,003 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 10:39:56,004 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 42 treesize of output 42 [2022-12-14 10:39:56,013 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 16 treesize of output 18 [2022-12-14 10:39:56,039 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 26 treesize of output 20 [2022-12-14 10:39:56,101 INFO L321 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2022-12-14 10:39:56,101 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 21 treesize of output 31 [2022-12-14 10:39:56,107 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 8 treesize of output 7 [2022-12-14 10:39:57,251 INFO L321 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-12-14 10:39:57,251 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 145 treesize of output 126 [2022-12-14 10:39:57,574 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-12-14 10:39:57,574 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 127 [2022-12-14 10:40:00,696 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 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 10:40:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:40:00,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:40:01,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:01,180 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-12-14 10:40:01,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:01,195 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-12-14 10:40:01,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_337) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))) (_ bv1 32)) (not (= (select v_ArrVal_337 |c_ULTIMATE.start_main_~t~0#1.offset|) (_ bv1 32)))))) is different from false [2022-12-14 10:40:01,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_29| (_ BitVec 32))) (or (not (= (select v_ArrVal_337 (_ bv0 32)) (_ bv1 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_22 (_ bv4 32)))) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_337) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~t~0#1.base_29| v_arrayElimArr_21) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~t~0#1.base_29| v_arrayElimArr_22) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (_ bv1 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|))) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-12-14 10:40:01,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:01,388 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 55 treesize of output 56 [2022-12-14 10:40:01,399 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 90 [2022-12-14 10:40:01,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:01,414 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 86 treesize of output 76 [2022-12-14 10:40:01,426 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 114 [2022-12-14 10:40:01,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:01,449 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 116 treesize of output 114 [2022-12-14 10:40:01,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:01,476 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 108 treesize of output 94 [2022-12-14 10:40:02,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:40:02,550 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-12-14 10:40:16,342 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_ArrVal_326 (_ BitVec 1))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |v_ULTIMATE.start_main_~t~0#1.base_30|) (forall ((v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~t~0#1.base_30| v_ArrVal_331) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_337) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32)) (not (= (select v_ArrVal_337 (_ bv0 32)) (_ bv1 32))))) (not (= (_ bv0 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30| v_ArrVal_326) |v_ULTIMATE.start_main_~t~0#1.base_29|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))) is different from false [2022-12-14 10:40:16,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:16,413 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 26 treesize of output 32 [2022-12-14 10:40:16,429 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 122 treesize of output 110 [2022-12-14 10:40:16,450 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 45 treesize of output 41 [2022-12-14 10:40:16,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:16,507 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 92 treesize of output 90 [2022-12-14 10:40:22,451 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 32 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:40:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-14 10:40:22,497 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 10:40:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215657078] [2022-12-14 10:40:22,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215657078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:40:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [4194375] [2022-12-14 10:40:22,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:40:22,497 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 10:40:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 10:40:22,498 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 10:40:22,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-12-14 10:40:22,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:40:22,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:40:22,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 10:40:22,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:40:22,687 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 7 [2022-12-14 10:40:22,757 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 14 treesize of output 15 [2022-12-14 10:40:22,969 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 10:40:22,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 10:40:23,444 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 10:40:23,491 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 10:40:23,509 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 18 treesize of output 20 [2022-12-14 10:40:24,045 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 10:40:24,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 10:40:24,594 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:40:24,612 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 19 treesize of output 21 [2022-12-14 10:40:24,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 10:40:24,648 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 42 treesize of output 36 [2022-12-14 10:40:24,783 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 8 treesize of output 7 [2022-12-14 10:40:26,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:40:26,507 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-12-14 10:40:26,507 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 49 [2022-12-14 10:40:26,583 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 10:40:26,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-12-14 10:40:26,925 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 10:40:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:40:26,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:40:27,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:27,132 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-12-14 10:40:27,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:27,170 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-12-14 10:40:27,247 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (select v_arrayElimArr_28 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_27 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))) (_ bv1 32))))) is different from false [2022-12-14 10:40:27,394 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_32| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|))) (not (= (select v_arrayElimArr_27 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_393) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~t~0#1.base_32| v_arrayElimArr_27) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~t~0#1.base_32| v_arrayElimArr_28) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (_ bv1 32)))) is different from false [2022-12-14 10:40:27,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:27,438 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 51 treesize of output 52 [2022-12-14 10:40:27,468 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 10:40:27,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:27,504 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 78 treesize of output 68 [2022-12-14 10:40:27,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:27,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 37 treesize of output 39 [2022-12-14 10:40:27,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 112 treesize of output 94 [2022-12-14 10:40:27,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:27,699 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 96 treesize of output 94 [2022-12-14 10:40:28,542 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 10:40:42,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:42,050 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 26 treesize of output 32 [2022-12-14 10:40:42,068 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 122 treesize of output 110 [2022-12-14 10:40:42,087 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 90 treesize of output 86 [2022-12-14 10:40:42,106 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 86 treesize of output 78 [2022-12-14 10:40:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 10:40:45,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [4194375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:40:45,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344432866] [2022-12-14 10:40:45,656 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:40:45,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:40:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:40:45,657 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:40:45,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 10:40:45,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:40:45,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:40:45,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 10:40:45,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:40:45,755 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 7 [2022-12-14 10:40:48,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 10:40:48,552 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 10:40:48,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 10:40:49,029 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 10:40:49,047 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 18 treesize of output 20 [2022-12-14 10:40:49,067 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 10:40:49,623 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 10:40:49,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 10:40:50,209 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:40:50,227 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 48 treesize of output 42 [2022-12-14 10:40:50,260 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 30 treesize of output 32 [2022-12-14 10:40:50,278 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 33 treesize of output 35 [2022-12-14 10:40:50,296 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 8 treesize of output 7 [2022-12-14 10:40:51,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:40:51,863 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-12-14 10:40:51,863 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 46 [2022-12-14 10:40:51,929 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 10:40:51,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2022-12-14 10:40:51,960 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 10:40:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:40:51,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:40:52,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:52,154 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-12-14 10:40:52,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:52,187 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-12-14 10:40:52,258 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_449) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_33) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_34) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (_ bv1 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_33 .cse1))) (not (= (select v_arrayElimArr_34 .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|))))) is different from false [2022-12-14 10:40:52,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_35| (_ BitVec 32)) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_34 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~t~0#1.base_35| v_ArrVal_449) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~t~0#1.base_35| v_arrayElimArr_33) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~t~0#1.base_35| v_arrayElimArr_34) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (_ bv1 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_35|))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_33 (_ bv4 32)))))) is different from false [2022-12-14 10:40:52,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:52,633 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 51 treesize of output 52 [2022-12-14 10:40:52,663 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 10:40:52,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:52,699 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 78 treesize of output 68 [2022-12-14 10:40:52,730 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 120 treesize of output 102 [2022-12-14 10:40:52,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:52,796 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 104 treesize of output 102 [2022-12-14 10:40:52,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:52,878 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 55 treesize of output 53 [2022-12-14 10:40:53,668 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 10:41:00,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:00,928 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 26 treesize of output 32 [2022-12-14 10:41:00,945 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 60 treesize of output 52 [2022-12-14 10:41:00,962 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 40 treesize of output 36 [2022-12-14 10:41:00,980 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 22 treesize of output 20 [2022-12-14 10:41:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 10:41:01,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344432866] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:41:01,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 10:41:01,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11, 11, 11, 11] total 44 [2022-12-14 10:41:01,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391793947] [2022-12-14 10:41:01,561 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 10:41:01,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 10:41:01,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 10:41:01,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 10:41:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1165, Unknown=26, NotChecked=532, Total=1892 [2022-12-14 10:41:01,564 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 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 10:41:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:41:12,526 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-12-14 10:41:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:41:12,528 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 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 21 [2022-12-14 10:41:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:41:12,528 INFO L225 Difference]: With dead ends: 30 [2022-12-14 10:41:12,528 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 10:41:12,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 54.2s TimeCoverageRelationStatistics Valid=392, Invalid=1772, Unknown=26, NotChecked=672, Total=2862 [2022-12-14 10:41:12,531 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:41:12,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 52 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 218 Invalid, 0 Unknown, 154 Unchecked, 4.0s Time] [2022-12-14 10:41:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 10:41:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-12-14 10:41:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 10:41:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-12-14 10:41:12,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2022-12-14 10:41:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:41:12,538 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-12-14 10:41:12,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 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 10:41:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-12-14 10:41:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:41:12,539 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:41:12,540 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-14 10:41:12,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2022-12-14 10:41:12,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 10:41:12,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-14 10:41:13,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:41:13,142 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:41:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:41:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash 134691839, now seen corresponding path program 5 times [2022-12-14 10:41:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 10:41:13,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959386629] [2022-12-14 10:41:13,145 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 10:41:13,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 10:41:13,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 10:41:13,148 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 10:41:13,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-14 10:41:13,261 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-14 10:41:13,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:41:13,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 10:41:13,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:41:13,417 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 7 [2022-12-14 10:41:13,618 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 10:41:13,652 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 10:41:14,001 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 10:41:14,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 10:41:14,367 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:41:14,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 10:41:14,404 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 8 treesize of output 7 [2022-12-14 10:41:14,442 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 16 treesize of output 18 [2022-12-14 10:41:14,904 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 10:41:14,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 10:41:15,426 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:41:15,535 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-14 10:41:15,536 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 55 treesize of output 51 [2022-12-14 10:41:15,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:15,627 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 36 treesize of output 41 [2022-12-14 10:41:15,703 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 8 treesize of output 7 [2022-12-14 10:41:18,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:18,765 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-12-14 10:41:18,766 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 159 treesize of output 93 [2022-12-14 10:41:18,914 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-12-14 10:41:18,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 36 [2022-12-14 10:41:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:41:19,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:41:20,888 INFO L321 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2022-12-14 10:41:20,888 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 52 treesize of output 51 [2022-12-14 10:41:21,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:21,939 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 161 [2022-12-14 10:41:21,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:21,976 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 131 [2022-12-14 10:41:22,627 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_40))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~p~0#1.base|) .cse3))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_41) |c_ULTIMATE.start_main_~p~0#1.base|) .cse3))))) (or (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_40 .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse0 (_ bv0 32))))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_41 .cse1))))) (forall ((v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_41)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_40))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~p~0#1.base|) .cse3)) (.cse6 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) .cse3)))) (or (not (= (select v_arrayElimArr_40 .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select .cse4 .cse5) .cse6) |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select .cse7 .cse5) .cse6) (_ bv0 32)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_41 .cse1))))) (forall ((v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_41)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_40))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) .cse3)) (.cse10 (bvadd (_ bv4 32) (select (select .cse11 |c_ULTIMATE.start_main_~p~0#1.base|) .cse3)))) (or (= (select (select .cse8 .cse9) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_40 .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select .cse11 .cse9) .cse10) (_ bv0 32)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_41 .cse1))))) (forall ((v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_41))) (select (select .cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_40) |c_ULTIMATE.start_main_~p~0#1.base|) .cse3)) (bvadd (_ bv4 32) (select (select .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) .cse3)))))) (or (not (= (select v_arrayElimArr_40 .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse12 (_ bv0 32)) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_41 .cse1))))))) is different from false [2022-12-14 10:41:25,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:25,306 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 97 [2022-12-14 10:41:25,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:25,341 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 87 [2022-12-14 10:41:25,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:25,504 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 97 [2022-12-14 10:41:25,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:25,544 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 87 [2022-12-14 10:41:25,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:25,714 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 102 [2022-12-14 10:41:25,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:25,753 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 87 [2022-12-14 10:41:25,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:25,939 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 102 [2022-12-14 10:41:25,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:25,977 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 87 [2022-12-14 10:41:26,158 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32)) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_46) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_41)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_47) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_40))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4)) (.cse2 (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4) (_ bv4 32)))) (or (= (select (select .cse0 .cse1) .cse2) |c_ULTIMATE.start_main_~t~0#1.offset|) (not (= (select v_arrayElimArr_41 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (= (select (select .cse3 .cse1) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_47 .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_46 .cse4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (not (= (select v_arrayElimArr_40 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_49 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_48) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_41)) (.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_49) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_40))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4)) (.cse7 (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4) (_ bv4 32)))) (or (not (= (select v_arrayElimArr_41 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (= (select (select .cse5 .cse6) .cse7) (_ bv0 32)) (not (= (select v_arrayElimArr_48 .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (select .cse8 .cse6) .cse7)) (not (= (select v_arrayElimArr_40 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= (select v_arrayElimArr_49 .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32)) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_45 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_44) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_41))) (select (select .cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_45) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_40) |c_ULTIMATE.start_main_~t~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse10 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4)))))) (or (not (= (select v_arrayElimArr_45 .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_41 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_44 .cse4))) (= .cse9 |c_ULTIMATE.start_main_~t~0#1.offset|) (= .cse9 (_ bv0 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (not (= (select v_arrayElimArr_40 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse11 (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_42) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_40))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_43) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_41) |c_ULTIMATE.start_main_~t~0#1.base|) .cse4) (_ bv4 32))))) (or (not (= (select v_arrayElimArr_41 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_43 .cse4))) (not (= (select v_arrayElimArr_42 .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (not (= (select v_arrayElimArr_40 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse11 (_ bv0 32)) (= |c_ULTIMATE.start_main_~t~0#1.base| .cse11)))))) is different from false [2022-12-14 10:41:27,343 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32)) (v_arrayElimArr_45 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_40 (_ bv4 32)))) (or (not (= (select v_arrayElimArr_44 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| .cse0))) (not (= (select (store |c_#valid| .cse0 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_45 (_ bv4 32)))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_44) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_41))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_45) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_40) .cse0) (_ bv4 32))) (bvadd (select (select .cse1 .cse0) (_ bv4 32)) (_ bv4 32)))) (_ bv0 32)) (not (= (select v_arrayElimArr_41 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse2 (select v_arrayElimArr_40 (_ bv4 32)))) (let ((.cse3 (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_42) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_40))) (select .cse4 (select (select .cse4 .cse2) (_ bv4 32)))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_arrayElimArr_43) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_41) .cse2) (_ bv4 32)))))) (or (not (= (select v_arrayElimArr_43 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= .cse2 .cse3) (not (= (_ bv0 1) (select |c_#valid| .cse2))) (not (= (select (store |c_#valid| .cse2 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (not (= (select v_arrayElimArr_41 (_ bv4 32)) (_ bv0 32))) (= .cse3 (_ bv0 32)) (not (= (select v_arrayElimArr_42 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_49 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse5 (select v_arrayElimArr_40 (_ bv4 32)))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse5 v_arrayElimArr_48) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_41)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_49) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_40))) (let ((.cse7 (select (select .cse9 .cse5) (_ bv4 32))) (.cse8 (bvadd (_ bv4 32) (select (select .cse6 .cse5) (_ bv4 32))))) (or (not (= (_ bv0 1) (select |c_#valid| .cse5))) (not (= (select v_arrayElimArr_48 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select (store |c_#valid| .cse5 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (not (= (select v_arrayElimArr_41 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_49 (_ bv4 32)))) (= (select (select .cse6 .cse7) .cse8) (_ bv0 32)) (= (select (select .cse9 .cse7) .cse8) .cse5)))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32)) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_40 (_ bv4 32)))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse13 v_arrayElimArr_46) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_41)) (.cse10 (store (store |c_#memory_$Pointer$.base| .cse13 v_arrayElimArr_47) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_40))) (let ((.cse11 (select (select .cse10 .cse13) (_ bv4 32))) (.cse12 (bvadd (_ bv4 32) (select (select .cse14 .cse13) (_ bv4 32))))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_46 (_ bv4 32)))) (= (select (select .cse10 .cse11) .cse12) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_47 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse13))) (= (select (select .cse14 .cse11) .cse12) (_ bv0 32)) (not (= (select (store |c_#valid| .cse13 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (not (= (select v_arrayElimArr_41 (_ bv4 32)) (_ bv0 32))))))))) is different from false [2022-12-14 10:41:27,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:27,435 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 153 treesize of output 143 [2022-12-14 10:41:27,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:27,472 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 133 treesize of output 103 [2022-12-14 10:41:27,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:27,492 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 79 treesize of output 73 [2022-12-14 10:41:27,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:27,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:27,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 413 treesize of output 367 [2022-12-14 10:41:27,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:27,603 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 382 treesize of output 292 [2022-12-14 10:41:27,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:27,676 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 273 treesize of output 201 [2022-12-14 10:41:27,702 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 27 treesize of output 21 [2022-12-14 10:41:28,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:28,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 133 [2022-12-14 10:41:28,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:28,993 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 123 treesize of output 103 [2022-12-14 10:41:29,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:29,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:29,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:29,062 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 187 [2022-12-14 10:41:29,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:29,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:29,116 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 163 [2022-12-14 10:41:29,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:29,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 82 treesize of output 78 [2022-12-14 10:41:29,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:29,273 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 153 treesize of output 131 [2022-12-14 10:41:29,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:29,349 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 136 treesize of output 114 [2022-12-14 10:41:29,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:29,417 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 63 [2022-12-14 10:41:30,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:30,553 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 151 treesize of output 131 [2022-12-14 10:41:30,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:30,591 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 121 treesize of output 101 [2022-12-14 10:41:30,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:30,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:30,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:30,659 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 185 [2022-12-14 10:41:30,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:30,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:30,695 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 155 [2022-12-14 10:41:30,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:30,775 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 157 treesize of output 135 [2022-12-14 10:41:30,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:30,865 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 70 treesize of output 66 [2022-12-14 10:41:30,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:30,947 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 128 treesize of output 114 [2022-12-14 10:41:31,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:31,019 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 63 [2022-12-14 10:41:32,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:32,305 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 75 treesize of output 66 [2022-12-14 10:41:32,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:32,349 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 55 treesize of output 56 [2022-12-14 10:41:32,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:32,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:32,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:32,412 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 346 [2022-12-14 10:41:32,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:32,434 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 184 treesize of output 178 [2022-12-14 10:41:32,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:32,520 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 180 treesize of output 164 [2022-12-14 10:41:32,541 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 169 treesize of output 149 [2022-12-14 10:41:32,562 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 140 treesize of output 110 [2022-12-14 10:41:32,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:32,630 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 120 [2022-12-14 10:41:39,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:39,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:39,972 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-14 10:41:39,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 12 [2022-12-14 10:41:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-14 10:41:39,996 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 10:41:39,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959386629] [2022-12-14 10:41:39,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959386629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:41:39,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1144807063] [2022-12-14 10:41:39,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 10:41:39,997 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 10:41:39,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 10:41:39,997 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 10:41:39,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-12-14 10:41:40,196 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-14 10:41:40,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:41:40,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 10:41:40,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:41:40,283 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 7 [2022-12-14 10:41:40,373 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 10:41:40,419 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 10:41:40,650 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 10:41:40,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 10:41:40,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:41:40,844 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 16 treesize of output 18 [2022-12-14 10:41:40,861 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 23 [2022-12-14 10:41:40,876 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 8 treesize of output 7 [2022-12-14 10:41:41,141 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 10:41:41,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 10:41:41,444 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:41:41,543 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-14 10:41:41,543 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 55 treesize of output 51 [2022-12-14 10:41:41,563 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 36 treesize of output 41 [2022-12-14 10:41:41,627 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 8 treesize of output 7 [2022-12-14 10:41:43,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:44,009 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-12-14 10:41:44,010 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 82 [2022-12-14 10:41:44,140 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-12-14 10:41:44,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-12-14 10:41:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:41:44,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:41:45,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:45,628 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-12-14 10:41:45,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:45,664 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-12-14 10:41:45,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:45,760 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-12-14 10:41:45,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:45,800 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2022-12-14 10:41:45,876 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_61 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_60 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_61))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_60) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (bvadd (_ bv4 32) (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)))) (_ bv0 32)))) (forall ((v_arrayElimArr_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_62 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_62))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_63) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_63 .cse0))))))) is different from false [2022-12-14 10:41:47,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:47,581 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-14 10:41:47,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:47,621 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-12-14 10:41:47,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:47,783 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-14 10:41:47,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:47,825 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-12-14 10:41:47,978 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_64 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_65 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_65 .cse0))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_64) |v_ULTIMATE.start_main_~t~0#1.base_42| v_arrayElimArr_61))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_65) |v_ULTIMATE.start_main_~t~0#1.base_42| v_arrayElimArr_60) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)) (bvadd (select (select .cse1 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) (_ bv4 32)))) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| (select v_arrayElimArr_60 (_ bv4 32)))) (not (= (select v_arrayElimArr_61 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_64 .cse0))))) (forall ((v_arrayElimArr_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimArr_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_67 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_66 .cse0))) (not (= (select v_arrayElimArr_63 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_67 .cse0))) (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_66) |v_ULTIMATE.start_main_~t~0#1.base_42| v_arrayElimArr_62))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_67) |v_ULTIMATE.start_main_~t~0#1.base_42| v_arrayElimArr_63) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0))) (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (not (= (select v_arrayElimArr_62 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) is different from false [2022-12-14 10:41:49,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:49,110 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 75 treesize of output 76 [2022-12-14 10:41:49,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:49,153 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 65 treesize of output 56 [2022-12-14 10:41:49,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:49,176 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 38 [2022-12-14 10:41:49,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:49,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:49,205 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2022-12-14 10:41:49,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:49,288 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 82 treesize of output 72 [2022-12-14 10:41:49,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:49,368 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 77 treesize of output 67 [2022-12-14 10:41:49,388 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 27 treesize of output 21 [2022-12-14 10:41:50,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:50,452 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 75 treesize of output 66 [2022-12-14 10:41:50,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:50,494 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 55 treesize of output 56 [2022-12-14 10:41:50,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:50,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:50,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:50,566 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 152 [2022-12-14 10:41:50,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:50,589 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 86 treesize of output 80 [2022-12-14 10:41:50,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:50,668 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 82 treesize of output 78 [2022-12-14 10:41:50,693 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 70 treesize of output 56 [2022-12-14 10:41:50,712 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 71 treesize of output 63 [2022-12-14 10:41:50,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:50,779 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2022-12-14 10:41:53,468 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32))) (.cse4 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (not (= (_ bv0 1) (select (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))))) (.cse2 (= |c_ULTIMATE.start_main_~t~0#1.base| (_ bv0 32))) (.cse0 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse5 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 1))))) (and (forall ((v_arrayElimCell_245 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_245 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (= v_arrayElimCell_245 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_245))))) (or (forall ((v_arrayElimCell_245 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_245 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_245))))) .cse0) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (_ bv0 32)) (let ((.cse1 (and (forall ((v_arrayElimCell_245 (_ BitVec 32))) (or (= v_arrayElimCell_245 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_245))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (not (= (select (store |c_#valid| v_arrayElimCell_245 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|) (_ bv0 1)))))) (forall ((v_arrayElimCell_245 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (or (not (= (select (store |c_#valid| v_arrayElimCell_245 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_245)))))))) (and (or .cse1 .cse2) (forall ((v_arrayElimCell_245 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (or (not (= (select (store |c_#valid| v_arrayElimCell_245 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_245))) (= v_arrayElimCell_245 |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_arrayElimCell_245 (_ BitVec 32))) (or (= v_arrayElimCell_245 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_245))) (= v_arrayElimCell_245 |c_ULTIMATE.start_main_~t~0#1.base|) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (not (= (select (store |c_#valid| v_arrayElimCell_245 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|) (_ bv0 1)))))) (or .cse1 .cse0)))) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (or (forall ((v_arrayElimCell_253 (_ BitVec 32))) (or (not (= (select |c_#valid| v_arrayElimCell_253) (_ bv0 1))) (= v_arrayElimCell_253 |c_ULTIMATE.start_main_~t~0#1.base|) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_253 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimCell_253 (_ BitVec 32))) (or (not (= (select |c_#valid| v_arrayElimCell_253) (_ bv0 1))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_42|) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_253 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))))) .cse0))) (or (and (forall ((v_arrayElimCell_253 (_ BitVec 32))) (or (not (= (select |c_#valid| v_arrayElimCell_253) (_ bv0 1))) (not (= (select (store |c_#valid| v_arrayElimCell_253 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 1))))) (or .cse3 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimCell_253 (_ BitVec 32))) (or (not (= (select |c_#valid| v_arrayElimCell_253) (_ bv0 1))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_253 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|)))))) (or .cse4 .cse5)) .cse0) (or .cse4 (and .cse2 .cse0) .cse5))) is different from false [2022-12-14 10:41:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 10:41:54,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1144807063] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:41:54,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672976267] [2022-12-14 10:41:54,371 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 10:41:54,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:41:54,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:41:54,371 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:41:54,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 10:41:54,877 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-14 10:41:54,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:41:54,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 10:41:54,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:41:54,962 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 7 [2022-12-14 10:41:55,058 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 10:41:55,114 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 10:41:55,339 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 10:41:55,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 10:41:55,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:41:55,559 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 16 treesize of output 18 [2022-12-14 10:41:55,620 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 23 [2022-12-14 10:41:55,667 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 8 treesize of output 7 [2022-12-14 10:41:55,900 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 10:41:55,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 10:41:56,129 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 10:41:56,227 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-14 10:41:56,227 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 55 treesize of output 51 [2022-12-14 10:41:56,279 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 36 treesize of output 41 [2022-12-14 10:41:56,329 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 8 treesize of output 7 [2022-12-14 10:41:58,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:58,253 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-12-14 10:41:58,254 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 82 [2022-12-14 10:41:58,402 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-12-14 10:41:58,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-12-14 10:41:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:41:58,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:41:58,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:58,805 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-12-14 10:41:58,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:58,840 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-12-14 10:41:58,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:58,934 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-12-14 10:41:58,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:58,970 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2022-12-14 10:41:59,048 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_76 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_77 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_77 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_76))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_77) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (_ bv0 32)) (not (= (select v_arrayElimArr_76 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_74 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_75 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_74 .cse0))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_75))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_74) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)))) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_75 .cse0))))))) is different from false [2022-12-14 10:42:02,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:02,733 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-14 10:42:02,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:02,774 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-12-14 10:42:02,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:02,926 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-14 10:42:02,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:02,964 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-12-14 10:42:03,106 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimArr_80 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_81 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| (select v_arrayElimArr_60 (_ bv4 32)))) (= (_ bv0 32) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_80) |v_ULTIMATE.start_main_~t~0#1.base_42| v_arrayElimArr_61))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_81) |v_ULTIMATE.start_main_~t~0#1.base_42| v_arrayElimArr_60) |c_ULTIMATE.start_main_~t~0#1.base|) .cse1)) (bvadd (_ bv4 32) (select (select .cse0 |c_ULTIMATE.start_main_~t~0#1.base|) .cse1))))) (not (= (select v_arrayElimArr_61 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_81 .cse1))) (not (= (select v_arrayElimArr_80 .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_63 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimArr_78 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_79 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_63 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_79 .cse1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_78 .cse1))) (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_78) |v_ULTIMATE.start_main_~t~0#1.base_42| v_arrayElimArr_62))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) .cse1))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_79) |v_ULTIMATE.start_main_~t~0#1.base_42| v_arrayElimArr_63) |c_ULTIMATE.start_main_~t~0#1.base|) .cse1))) (_ bv0 32)) (not (= (select v_arrayElimArr_62 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) is different from false [2022-12-14 10:42:06,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:06,765 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 75 treesize of output 76 [2022-12-14 10:42:06,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:06,816 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 65 treesize of output 56 [2022-12-14 10:42:06,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:42:06,844 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 38 [2022-12-14 10:42:06,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:42:06,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:42:06,882 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 178 [2022-12-14 10:42:06,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:06,990 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 193 treesize of output 159 [2022-12-14 10:42:07,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:07,092 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 140 treesize of output 108 [2022-12-14 10:42:07,121 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 27 treesize of output 21 [2022-12-14 10:42:08,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:08,748 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 75 treesize of output 66 [2022-12-14 10:42:08,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:08,802 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 55 treesize of output 56 [2022-12-14 10:42:08,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:42:08,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:42:08,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:42:08,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 346 [2022-12-14 10:42:08,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:42:08,921 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 184 treesize of output 178 [2022-12-14 10:42:08,948 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 180 treesize of output 150 [2022-12-14 10:42:08,973 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 165 treesize of output 145 [2022-12-14 10:42:09,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:09,058 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 128 [2022-12-14 10:42:09,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:09,170 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 116 treesize of output 106 [2022-12-14 10:42:12,084 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~p~0#1.base| (_ bv0 32))) (.cse5 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_280 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))) (not (= (select |c_#valid| v_arrayElimCell_280) (_ bv0 1)))))) (.cse0 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse1 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (not (= (_ bv0 1) (select (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))))) (.cse4 (= |c_ULTIMATE.start_main_~t~0#1.base| (_ bv0 32))) (.cse2 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 1))))) (and (or (forall ((v_arrayElimCell_280 (_ BitVec 32))) (or (not (= (select (store |c_#valid| v_arrayElimCell_280 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 1))) (not (= (select |c_#valid| v_arrayElimCell_280) (_ bv0 1))))) .cse0) (forall ((v_arrayElimCell_280 (_ BitVec 32))) (or (= v_arrayElimCell_280 (_ bv0 32)) (not (= (select (store |c_#valid| v_arrayElimCell_280 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 1))) (not (= (select |c_#valid| v_arrayElimCell_280) (_ bv0 1))))) (or .cse1 .cse0 .cse2) (or (and (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimCell_287 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_287 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))) (= v_arrayElimCell_287 |c_ULTIMATE.start_main_~t~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_287) (_ bv0 1))))) .cse0) (forall ((v_arrayElimCell_287 (_ BitVec 32))) (or (= v_arrayElimCell_287 |c_ULTIMATE.start_main_~t~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_287) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_287 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_42|))))) (or (and (forall ((v_arrayElimCell_287 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_287 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|)))) (not (= (select |c_#valid| v_arrayElimCell_287) (_ bv0 1))))) (forall ((v_arrayElimCell_287 (_ BitVec 32))) (or (not (= (select |c_#valid| v_arrayElimCell_287) (_ bv0 1))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_287 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_42|)))))) .cse0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32))) (or .cse3 (and (or .cse4 (and (forall ((v_arrayElimCell_280 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_280 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (not (= (select |c_#valid| v_arrayElimCell_280) (_ bv0 1))))) (or .cse0 .cse5) (forall ((v_arrayElimCell_280 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_280 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|)))) (= v_arrayElimCell_280 (_ bv0 32)) (not (= (select |c_#valid| v_arrayElimCell_280) (_ bv0 1))))))) (forall ((v_arrayElimCell_280 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_280 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|)))) (= v_arrayElimCell_280 (_ bv0 32)) (= v_arrayElimCell_280 |c_ULTIMATE.start_main_~t~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_280) (_ bv0 1))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32)) (v_arrayElimCell_280 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_280 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))) (= v_arrayElimCell_280 |c_ULTIMATE.start_main_~t~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_280) (_ bv0 1)))))) (forall ((v_arrayElimCell_280 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_42| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_280 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_42|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_42|))) (= v_arrayElimCell_280 |c_ULTIMATE.start_main_~t~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_280) (_ bv0 1))))))) (or .cse0 (and (or .cse3 .cse5) (or .cse1 .cse2))) (or (forall ((v_arrayElimCell_287 (_ BitVec 32))) (or (not (= (select |c_#valid| v_arrayElimCell_287) (_ bv0 1))) (not (= (select (store |c_#valid| v_arrayElimCell_287 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 1))))) .cse0) (or .cse1 .cse4 .cse2))) is different from false [2022-12-14 10:42:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 10:42:13,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672976267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:42:13,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 10:42:13,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11, 11, 11, 11] total 39 [2022-12-14 10:42:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686829856] [2022-12-14 10:42:13,465 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 10:42:13,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 10:42:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 10:42:13,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 10:42:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=750, Unknown=22, NotChecked=576, Total=1482 [2022-12-14 10:42:13,467 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 39 states have internal predecessors, (80), 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 10:42:33,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-12-14 10:42:33,029 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-14 10:42:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:42:33,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=142, Invalid=802, Unknown=22, NotChecked=594, Total=1560 [2022-12-14 10:42:33,031 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:42:33,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 43 Unchecked, 1.2s Time] [2022-12-14 10:42:33,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-14 10:42:33,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2022-12-14 10:42:33,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 10:42:33,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:42:33,635 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 57 more [2022-12-14 10:42:33,643 INFO L158 Benchmark]: Toolchain (without parser) took 182375.46ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 34.6MB in the beginning and 30.9MB in the end (delta: 3.7MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-12-14 10:42:33,643 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:42:33,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.22ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 34.3MB in the beginning and 53.2MB in the end (delta: -19.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-12-14 10:42:33,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.54ms. Allocated memory is still 83.9MB. Free memory was 53.2MB in the beginning and 51.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:42:33,644 INFO L158 Benchmark]: Boogie Preprocessor took 21.19ms. Allocated memory is still 83.9MB. Free memory was 51.2MB in the beginning and 49.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:42:33,644 INFO L158 Benchmark]: RCFGBuilder took 259.75ms. Allocated memory is still 83.9MB. Free memory was 49.7MB in the beginning and 61.6MB in the end (delta: -11.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-12-14 10:42:33,644 INFO L158 Benchmark]: TraceAbstraction took 181780.47ms. Allocated memory is still 83.9MB. Free memory was 60.8MB in the beginning and 30.9MB in the end (delta: 29.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2022-12-14 10:42:33,645 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.22ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 34.3MB in the beginning and 53.2MB in the end (delta: -19.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.54ms. Allocated memory is still 83.9MB. Free memory was 53.2MB in the beginning and 51.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.19ms. Allocated memory is still 83.9MB. Free memory was 51.2MB in the beginning and 49.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.75ms. Allocated memory is still 83.9MB. Free memory was 49.7MB in the beginning and 61.6MB in the end (delta: -11.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 181780.47ms. Allocated memory is still 83.9MB. Free memory was 60.8MB in the beginning and 30.9MB in the end (delta: 29.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_799a6d9a-aae4-4a32-ad2c-ebfec7adf344/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")