./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array11_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-patterns/array11_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:13:24,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:13:24,447 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:13:24,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:13:24,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:13:24,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:13:24,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:13:24,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:13:24,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:13:24,476 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:13:24,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:13:24,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:13:24,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:13:24,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:13:24,479 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:13:24,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:13:24,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:13:24,481 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:13:24,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:13:24,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:13:24,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:13:24,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:13:24,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:13:24,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:13:24,485 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:13:24,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:13:24,486 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:13:24,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:13:24,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:13:24,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:13:24,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:13:24,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:13:24,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:13:24,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:13:24,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:13:24,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:13:24,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:13:24,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:13:24,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:13:24,489 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:13:24,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:13:24,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:13:24,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/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_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer 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 -> c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb [2023-11-29 06:13:24,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:13:24,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:13:24,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:13:24,732 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:13:24,732 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:13:24,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-patterns/array11_pattern.c [2023-11-29 06:13:27,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:13:27,703 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:13:27,704 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/sv-benchmarks/c/array-patterns/array11_pattern.c [2023-11-29 06:13:27,711 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/data/eed7f8eb8/65618eb0cb8d4dc69ab4f4ffdff2bbf8/FLAGf9e4091bd [2023-11-29 06:13:27,726 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/data/eed7f8eb8/65618eb0cb8d4dc69ab4f4ffdff2bbf8 [2023-11-29 06:13:27,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:13:27,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:13:27,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:13:27,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:13:27,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:13:27,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:27,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c90044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27, skipping insertion in model container [2023-11-29 06:13:27,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:27,760 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:13:27,905 WARN L240 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_55239e87-9d31-408d-b90c-648f2fdb0525/sv-benchmarks/c/array-patterns/array11_pattern.c[1357,1370] [2023-11-29 06:13:27,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:13:27,937 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:13:27,950 WARN L240 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_55239e87-9d31-408d-b90c-648f2fdb0525/sv-benchmarks/c/array-patterns/array11_pattern.c[1357,1370] [2023-11-29 06:13:27,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:13:27,977 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:13:27,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27 WrapperNode [2023-11-29 06:13:27,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:13:27,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:13:27,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:13:27,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:13:27,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:27,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,017 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2023-11-29 06:13:28,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:13:28,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:13:28,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:13:28,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:13:28,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,047 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2023-11-29 06:13:28,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:13:28,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:13:28,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:13:28,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:13:28,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (1/1) ... [2023-11-29 06:13:28,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:13:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:28,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:13:28,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:13:28,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:13:28,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:13:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:13:28,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:13:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:13:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:13:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:13:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:13:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:13:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:13:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:13:28,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:13:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:13:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:13:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:13:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:13:28,221 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:13:28,222 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:13:28,368 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:13:28,390 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:13:28,390 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 06:13:28,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:13:28 BoogieIcfgContainer [2023-11-29 06:13:28,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:13:28,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:13:28,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:13:28,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:13:28,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:13:27" (1/3) ... [2023-11-29 06:13:28,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ed1e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:13:28, skipping insertion in model container [2023-11-29 06:13:28,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:13:27" (2/3) ... [2023-11-29 06:13:28,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ed1e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:13:28, skipping insertion in model container [2023-11-29 06:13:28,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:13:28" (3/3) ... [2023-11-29 06:13:28,400 INFO L112 eAbstractionObserver]: Analyzing ICFG array11_pattern.c [2023-11-29 06:13:28,415 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:13:28,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:13:28,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:13:28,463 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@30f8ecbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:13:28,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:13:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 06:13:28,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:13:28,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:28,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:13:28,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash -208916493, now seen corresponding path program 1 times [2023-11-29 06:13:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285220852] [2023-11-29 06:13:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:13:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:13:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:13:28,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285220852] [2023-11-29 06:13:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285220852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:13:28,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:13:28,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:13:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858316701] [2023-11-29 06:13:28,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:13:28,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:13:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:13:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:13:28,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:13:28,691 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:13:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:13:28,720 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2023-11-29 06:13:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:13:28,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-29 06:13:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:13:28,731 INFO L225 Difference]: With dead ends: 38 [2023-11-29 06:13:28,731 INFO L226 Difference]: Without dead ends: 18 [2023-11-29 06:13:28,734 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 [2023-11-29 06:13:28,738 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 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 [2023-11-29 06:13:28,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:13:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-29 06:13:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-29 06:13:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-11-29 06:13:28,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2023-11-29 06:13:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:13:28,778 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-11-29 06:13:28,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:13:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-11-29 06:13:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 06:13:28,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:13:28,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:28,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:13:28,781 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:13:28,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1520585160, now seen corresponding path program 1 times [2023-11-29 06:13:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381962715] [2023-11-29 06:13:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:28,813 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:13:28,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222652733] [2023-11-29 06:13:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:28,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:13:28,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:28,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:13:28,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:13:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:28,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:13:28,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:13:28,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:13:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:13:28,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381962715] [2023-11-29 06:13:28,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:13:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222652733] [2023-11-29 06:13:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222652733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:13:28,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:13:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:13:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859848399] [2023-11-29 06:13:28,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:13:28,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:13:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:13:28,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:13:28,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:13:28,992 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:13:29,021 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-11-29 06:13:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:13:29,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-11-29 06:13:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:13:29,023 INFO L225 Difference]: With dead ends: 23 [2023-11-29 06:13:29,023 INFO L226 Difference]: Without dead ends: 19 [2023-11-29 06:13:29,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:13:29,025 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:13:29,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:13:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-29 06:13:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-29 06:13:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-29 06:13:29,032 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 21 [2023-11-29 06:13:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:13:29,033 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-29 06:13:29,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-29 06:13:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 06:13:29,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:13:29,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:29,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:29,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:13:29,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:13:29,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash 133041195, now seen corresponding path program 1 times [2023-11-29 06:13:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:29,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651288398] [2023-11-29 06:13:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:29,254 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:13:29,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444015332] [2023-11-29 06:13:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:29,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:13:29,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:29,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:13:29,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:13:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:29,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:13:29,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:13:29,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:13:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:13:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651288398] [2023-11-29 06:13:29,380 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:13:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444015332] [2023-11-29 06:13:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444015332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:13:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:13:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:13:29,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315704328] [2023-11-29 06:13:29,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:13:29,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:13:29,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:13:29,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:13:29,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:13:29,383 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:13:29,712 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-29 06:13:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:13:29,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-29 06:13:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:13:29,713 INFO L225 Difference]: With dead ends: 35 [2023-11-29 06:13:29,713 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 06:13:29,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:13:29,715 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:13:29,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:13:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 06:13:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-29 06:13:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-11-29 06:13:29,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 22 [2023-11-29 06:13:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:13:29,721 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-11-29 06:13:29,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:13:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-11-29 06:13:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 06:13:29,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:13:29,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:29,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:13:29,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-29 06:13:29,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:13:29,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1617342797, now seen corresponding path program 1 times [2023-11-29 06:13:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:13:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025790233] [2023-11-29 06:13:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:29,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:13:29,949 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:13:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56097776] [2023-11-29 06:13:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:29,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:13:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:13:29,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:13:29,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:13:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:30,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 06:13:30,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:30,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:13:30,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:13:30,665 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 06:13:30,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 06:13:30,689 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 06:13:30,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 06:13:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:13:30,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:13:40,595 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:14:04,727 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:15:03,604 WARN L293 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:15:19,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse5 (* .cse23 4)) (.cse28 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse19 (= (+ |c_ULTIMATE.start_main_~index~0#1| 1) c_~ARR_SIZE~0)) (.cse6 (+ .cse28 (- 4294967296))) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse27 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5))) (let ((.cse15 (< .cse28 2147483648)) (.cse16 (select (store .cse4 .cse27 .cse28) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse17 (< 2147483647 .cse28)) (.cse18 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5)) (.cse1 (* c_~ARR_SIZE~0 2)) (.cse13 (select (store .cse4 .cse27 .cse6) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse24 (not .cse19)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5))) (let ((.cse0 (< .cse23 2147483648)) (.cse10 (let ((.cse26 (select (store .cse7 .cse8 (+ .cse23 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= 0 (+ .cse13 |c_ULTIMATE.start_main_~sum~0#1| .cse26)) (= .cse1 (+ .cse13 |c_ULTIMATE.start_main_~sum~0#1| .cse26 2)) .cse24))) (.cse12 (or .cse24 (let ((.cse25 (select (store .cse7 .cse18 .cse23) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or .cse15 (= .cse1 (+ .cse13 .cse25 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= (+ .cse13 .cse25 |c_ULTIMATE.start_main_~sum~0#1|) 0)) (or (= .cse1 (+ .cse25 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse16)) (= (+ .cse25 |c_ULTIMATE.start_main_~sum~0#1| .cse16) 0) .cse17))))) (.cse11 (< 2147483647 .cse23)) (.cse9 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (or (and (or .cse0 (and (let ((.cse2 (select (store .cse7 .cse8 .cse9) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse3 (select (store .cse4 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5) .cse6) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse1 (+ .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= 0 (+ .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))) .cse10)) (or .cse11 (and .cse12 (or (let ((.cse14 (select (store .cse7 .cse18 .cse9) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= (+ .cse13 |c_ULTIMATE.start_main_~sum~0#1| .cse14) 0) .cse15 (= (+ .cse13 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse14) .cse1)) (or (= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse14 .cse16)) .cse17 (= .cse1 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse14 .cse16))))) .cse19)))) (< 2147483647 .cse9)) (or (< .cse9 2147483648) (let ((.cse21 (+ .cse9 (- 4294967296)))) (and (or .cse0 (and .cse10 (let ((.cse20 (select (store .cse7 .cse8 .cse21) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse16 .cse20) 0) (= .cse1 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse16 .cse20)))))) (or (and .cse12 (or (let ((.cse22 (select (store .cse7 .cse18 .cse21) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= .cse1 (+ .cse22 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse16)) .cse17 (= (+ .cse22 |c_ULTIMATE.start_main_~sum~0#1| .cse16) 0)) (or (= (+ .cse13 .cse22 |c_ULTIMATE.start_main_~sum~0#1|) 0) (= .cse1 (+ .cse13 .cse22 |c_ULTIMATE.start_main_~sum~0#1| 2)) .cse15))) .cse19)) .cse11)))))))))) is different from false [2023-11-29 06:15:45,960 WARN L293 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:15:56,914 WARN L293 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:16:30,315 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:18:29,686 WARN L293 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 105 DAG size of output: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:18:56,439 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:20:55,536 WARN L293 SmtUtils]: Spent 32.41s on a formula simplification. DAG size of input: 185 DAG size of output: 164 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:21:17,080 WARN L876 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~count~0#1| c_~ARR_SIZE~0) (let ((.cse0 (* c_~ARR_SIZE~0 2)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse4 (* v_y_6 4294967296)) (.cse3 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse8 (* v_z_6 4)) (.cse6 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse1 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8) (+ .cse6 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse2 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8) (+ .cse3 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse5 (+ .cse4 v_z_6))) (or (< 4294967295 v_z_6) (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse2)) (< .cse3 2147483648) (< c_~ARR_SIZE~0 (+ .cse4 v_z_6 1)) (= 0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| .cse2)) (< .cse5 0) (< v_z_6 0) (< 32767 .cse5) (< .cse6 2147483648))))) (forall ((v_z_2 Int) (v_y_2 Int)) (let ((.cse15 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse16 (* v_z_2 4)) (.cse14 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse10 (* v_y_2 4294967296))) (let ((.cse13 (+ .cse10 v_z_2)) (.cse11 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16) .cse14) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse12 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16) (+ .cse15 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (< c_~ARR_SIZE~0 (+ .cse10 v_z_2 1)) (< 4294967295 v_z_2) (= .cse0 (+ .cse11 .cse12 |c_ULTIMATE.start_main_~sum~0#1| 2)) (< .cse13 0) (< 32767 .cse13) (< 2147483647 .cse14) (< .cse15 2147483648) (= (+ .cse11 .cse12 |c_ULTIMATE.start_main_~sum~0#1|) 0) (< v_z_2 0))))) (let ((.cse20 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse19 (* .cse20 4))) (let ((.cse17 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19) (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* c_~ARR_SIZE~0 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse18 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19) .cse20) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (< 32768 c_~ARR_SIZE~0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse17 .cse18)) (< c_~ARR_SIZE~0 1) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse17 .cse18) 0))))) (forall ((v_z_7 Int) (v_y_7 Int)) (let ((.cse23 (* v_y_7 4294967296)) (.cse26 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse27 (* v_z_7 4)) (.cse21 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse24 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse27) (+ .cse21 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse25 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse27) .cse26) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse22 (+ .cse23 v_z_7))) (or (< .cse21 2147483648) (< 32767 .cse22) (< v_z_7 0) (< c_~ARR_SIZE~0 (+ .cse23 v_z_7 1)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse24 .cse25) 0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse24 .cse25)) (< 2147483647 .cse26) (< 4294967295 v_z_7) (< .cse22 0))))) (forall ((v_z_3 Int) (v_y_3 Int)) (let ((.cse33 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse34 (* v_z_3 4)) (.cse30 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse31 (* v_y_3 4294967296))) (let ((.cse32 (+ v_z_3 .cse31)) (.cse28 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse34) .cse30) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse29 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse34) .cse33) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ .cse28 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse29)) (< 2147483647 .cse30) (< 4294967295 v_z_3) (< c_~ARR_SIZE~0 (+ v_z_3 .cse31 1)) (< .cse32 0) (< 32767 .cse32) (< v_z_3 0) (< 2147483647 .cse33) (= (+ .cse28 |c_ULTIMATE.start_main_~sum~0#1| .cse29) 0)))))))) is different from true [2023-11-29 06:21:17,231 INFO L378 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 118 treesize of output 114 [2023-11-29 06:21:17,249 INFO L378 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 114 treesize of output 110 [2023-11-29 06:21:17,272 INFO L378 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 675 treesize of output 667 [2023-11-29 06:21:17,316 INFO L378 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 223 treesize of output 219 [2023-11-29 06:21:34,141 INFO L378 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 140 treesize of output 136 [2023-11-29 06:21:34,150 INFO L378 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 136 treesize of output 132 [2023-11-29 06:21:34,161 INFO L378 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 807 treesize of output 799 [2023-11-29 06:21:34,180 INFO L378 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 450 treesize of output 442 [2023-11-29 06:21:34,717 INFO L378 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 114 treesize of output 110 [2023-11-29 06:21:36,276 INFO L378 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 110 treesize of output 106 [2023-11-29 06:21:36,300 INFO L378 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 337 treesize of output 333 [2023-11-29 06:21:36,660 INFO L378 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 461 treesize of output 453 [2023-11-29 06:22:02,159 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:22:20,485 INFO L378 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 110 treesize of output 106 [2023-11-29 06:22:20,498 INFO L378 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 106 treesize of output 102 [2023-11-29 06:22:20,513 INFO L378 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 639 treesize of output 631 [2023-11-29 06:22:20,540 INFO L378 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 378 treesize of output 370 [2023-11-29 06:22:26,783 INFO L378 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 114 treesize of output 110 [2023-11-29 06:22:27,160 INFO L378 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 110 treesize of output 106 [2023-11-29 06:22:27,177 INFO L378 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 667 treesize of output 659 [2023-11-29 06:22:27,207 INFO L378 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 408 treesize of output 400 [2023-11-29 06:23:04,896 WARN L293 SmtUtils]: Spent 28.13s on a formula simplification. DAG size of input: 114 DAG size of output: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:23:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-29 06:23:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:23:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025790233] [2023-11-29 06:23:05,005 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:23:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56097776] [2023-11-29 06:23:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56097776] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:23:05,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:23:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-11-29 06:23:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241977348] [2023-11-29 06:23:05,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:23:05,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 06:23:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:23:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 06:23:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=8, NotChecked=94, Total=702 [2023-11-29 06:23:05,014 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 27 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 06:23:08,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:23:12,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:23:22,716 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~ARR_SIZE~0 2)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse2)) (= (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| .cse2) 0))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse8 (* v_y_6 4294967296)) (.cse7 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse11 (* v_z_6 4)) (.cse10 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse5 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11) (+ .cse10 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse6 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse11) (+ .cse7 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse9 (+ .cse8 v_z_6))) (or (< 4294967295 v_z_6) (= .cse0 (+ .cse5 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse6)) (< .cse7 2147483648) (< c_~ARR_SIZE~0 (+ .cse8 v_z_6 1)) (= 0 (+ .cse5 |c_ULTIMATE.start_main_~sum~0#1| .cse6)) (< .cse9 0) (< v_z_6 0) (< 32767 .cse9) (< .cse10 2147483648))))) (or (= |c_ULTIMATE.start_main_~sum~0#1| 0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2))) (forall ((v_z_2 Int) (v_y_2 Int)) (let ((.cse17 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse18 (* v_z_2 4)) (.cse16 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse12 (* v_y_2 4294967296))) (let ((.cse15 (+ .cse12 v_z_2)) (.cse13 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse18) .cse16) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18) (+ .cse17 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (< c_~ARR_SIZE~0 (+ .cse12 v_z_2 1)) (< 4294967295 v_z_2) (= .cse0 (+ .cse13 .cse14 |c_ULTIMATE.start_main_~sum~0#1| 2)) (< .cse15 0) (< 32767 .cse15) (< 2147483647 .cse16) (< .cse17 2147483648) (= (+ .cse13 .cse14 |c_ULTIMATE.start_main_~sum~0#1|) 0) (< v_z_2 0))))) (let ((.cse22 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse21 (* .cse22 4))) (let ((.cse19 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21) (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* c_~ARR_SIZE~0 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse20 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21) .cse22) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (< 32768 c_~ARR_SIZE~0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse19 .cse20)) (< c_~ARR_SIZE~0 1) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse19 .cse20) 0))))) (<= 1 c_~ARR_SIZE~0) (let ((.cse23 (+ |c_ULTIMATE.start_main_~index~0#1| 1))) (or (< |c_ULTIMATE.start_main_~index~0#1| 0) (< c_~ARR_SIZE~0 .cse23) (let ((.cse35 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse36 (* .cse35 4))) (let ((.cse38 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse36)) (.cse37 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse32 (= .cse23 c_~ARR_SIZE~0)) (.cse27 (< .cse37 2147483648)) (.cse25 (select (store .cse4 .cse38 (+ .cse37 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse28 (select (store .cse4 .cse38 .cse37) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse29 (< 2147483647 .cse37)) (.cse30 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse36))) (let ((.cse24 (or (not .cse32) (let ((.cse34 (select (store .cse3 .cse30 .cse35) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or .cse27 (= .cse0 (+ .cse25 .cse34 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= (+ .cse25 .cse34 |c_ULTIMATE.start_main_~sum~0#1|) 0)) (or (= .cse0 (+ .cse34 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse28)) (= (+ .cse34 |c_ULTIMATE.start_main_~sum~0#1| .cse28) 0) .cse29))))) (.cse31 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (or (and .cse24 (or (let ((.cse26 (select (store .cse3 .cse30 .cse31) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= (+ .cse25 |c_ULTIMATE.start_main_~sum~0#1| .cse26) 0) .cse27 (= (+ .cse25 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse26) .cse0)) (or (= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse26 .cse28)) .cse29 (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse26 .cse28))))) .cse32)) (< 2147483647 .cse31)) (or (< .cse31 2147483648) (and .cse24 (or (let ((.cse33 (select (store .cse3 .cse30 (+ .cse31 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= .cse0 (+ .cse33 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse28)) .cse29 (= (+ .cse33 |c_ULTIMATE.start_main_~sum~0#1| .cse28) 0)) (or (= (+ .cse25 .cse33 |c_ULTIMATE.start_main_~sum~0#1|) 0) (= .cse0 (+ .cse25 .cse33 |c_ULTIMATE.start_main_~sum~0#1| 2)) .cse27))) .cse32))))))))))) (forall ((v_z_7 Int) (v_y_7 Int)) (let ((.cse41 (* v_y_7 4294967296)) (.cse44 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse45 (* v_z_7 4)) (.cse39 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse42 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse45) (+ .cse39 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse43 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse45) .cse44) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse40 (+ .cse41 v_z_7))) (or (< .cse39 2147483648) (< 32767 .cse40) (< v_z_7 0) (< c_~ARR_SIZE~0 (+ .cse41 v_z_7 1)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse42 .cse43) 0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse42 .cse43)) (< 2147483647 .cse44) (< 4294967295 v_z_7) (< .cse40 0))))) (forall ((v_z_3 Int) (v_y_3 Int)) (let ((.cse51 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse52 (* v_z_3 4)) (.cse48 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse49 (* v_y_3 4294967296))) (let ((.cse50 (+ v_z_3 .cse49)) (.cse46 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse52) .cse48) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse47 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse52) .cse51) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ .cse46 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse47)) (< 2147483647 .cse48) (< 4294967295 v_z_3) (< c_~ARR_SIZE~0 (+ v_z_3 .cse49 1)) (< .cse50 0) (< 32767 .cse50) (< v_z_3 0) (< 2147483647 .cse51) (= (+ .cse46 |c_ULTIMATE.start_main_~sum~0#1| .cse47) 0))))))) is different from false [2023-11-29 06:23:24,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:23:29,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:23:33,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:23:35,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:23:37,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:23:56,648 WARN L293 SmtUtils]: Spent 15.78s on a formula simplification. DAG size of input: 114 DAG size of output: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:23:58,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:24:03,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:24:07,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:24:15,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:24:20,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:24:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:24:20,012 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-11-29 06:24:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 06:24:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-11-29 06:24:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:24:20,015 INFO L225 Difference]: With dead ends: 56 [2023-11-29 06:24:20,015 INFO L226 Difference]: Without dead ends: 52 [2023-11-29 06:24:20,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 251.9s TimeCoverageRelationStatistics Valid=275, Invalid=987, Unknown=10, NotChecked=210, Total=1482 [2023-11-29 06:24:20,017 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 20 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 39.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:24:20,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 176 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 269 Invalid, 5 Unknown, 169 Unchecked, 39.2s Time] [2023-11-29 06:24:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-29 06:24:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2023-11-29 06:24:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 06:24:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-29 06:24:20,037 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2023-11-29 06:24:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:24:20,037 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-29 06:24:20,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 06:24:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-29 06:24:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 06:24:20,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:24:20,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:20,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:24:20,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:20,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:24:20,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash 386052203, now seen corresponding path program 2 times [2023-11-29 06:24:20,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:20,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200051469] [2023-11-29 06:24:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:20,258 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:24:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099778197] [2023-11-29 06:24:20,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:24:20,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:20,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:24:20,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:24:20,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:24:20,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:24:20,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:24:20,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:24:20,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:24:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:20,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:24:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:24:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200051469] [2023-11-29 06:24:20,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:24:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099778197] [2023-11-29 06:24:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099778197] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:24:20,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:24:20,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-11-29 06:24:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868231996] [2023-11-29 06:24:20,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:24:20,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:24:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:24:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:24:20,712 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:24:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:24:21,240 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2023-11-29 06:24:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:24:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-29 06:24:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:24:21,242 INFO L225 Difference]: With dead ends: 47 [2023-11-29 06:24:21,242 INFO L226 Difference]: Without dead ends: 43 [2023-11-29 06:24:21,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:24:21,244 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:24:21,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:24:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-29 06:24:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2023-11-29 06:24:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:24:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-11-29 06:24:21,258 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 24 [2023-11-29 06:24:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:24:21,258 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-11-29 06:24:21,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:24:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-11-29 06:24:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 06:24:21,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:24:21,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:21,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:24:21,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:21,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:24:21,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1375439946, now seen corresponding path program 3 times [2023-11-29 06:24:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016605426] [2023-11-29 06:24:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:21,476 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:24:21,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29808936] [2023-11-29 06:24:21,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:24:21,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:21,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:24:21,477 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:24:21,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:24:21,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 06:24:21,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:24:21,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:24:21,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:24:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:21,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:24:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:24:21,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:21,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016605426] [2023-11-29 06:24:21,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:24:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29808936] [2023-11-29 06:24:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29808936] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:24:21,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:24:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-11-29 06:24:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535731591] [2023-11-29 06:24:21,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:24:21,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:24:21,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:21,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:24:21,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:24:21,910 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:24:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:24:22,352 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-11-29 06:24:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:24:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-29 06:24:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:24:22,353 INFO L225 Difference]: With dead ends: 42 [2023-11-29 06:24:22,353 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 06:24:22,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:24:22,354 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:24:22,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 62 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:24:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 06:24:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 06:24:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:24:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-11-29 06:24:22,370 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2023-11-29 06:24:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:24:22,370 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-11-29 06:24:22,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:24:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-11-29 06:24:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 06:24:22,371 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:24:22,371 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:22,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:24:22,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:22,572 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:24:22,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash -890742696, now seen corresponding path program 4 times [2023-11-29 06:24:22,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:22,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219782275] [2023-11-29 06:24:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:22,586 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:24:22,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [599092675] [2023-11-29 06:24:22,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:24:22,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:22,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:24:22,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:24:22,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55239e87-9d31-408d-b90c-648f2fdb0525/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:24:22,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:24:22,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:24:22,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 06:24:22,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:24:23,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:24:23,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:24:23,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:24:23,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:24:24,918 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-29 06:24:24,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 77 [2023-11-29 06:24:25,091 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-29 06:24:25,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 225 [2023-11-29 06:24:25,300 INFO L349 Elim1Store]: treesize reduction 38, result has 35.6 percent of original size [2023-11-29 06:24:25,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2023-11-29 06:24:25,701 INFO L349 Elim1Store]: treesize reduction 38, result has 35.6 percent of original size [2023-11-29 06:24:25,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2023-11-29 06:24:25,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:25,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:25,843 INFO L349 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2023-11-29 06:24:25,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 2 select indices, 2 select index equivalence classes, 13 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 602 [2023-11-29 06:24:26,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:26,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:26,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:26,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:26,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:26,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:26,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:26,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:26,962 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:27,088 INFO L349 Elim1Store]: treesize reduction 101, result has 29.9 percent of original size [2023-11-29 06:24:27,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 186 treesize of output 494 [2023-11-29 06:24:27,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:27,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:27,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:27,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:27,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:27,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:28,813 INFO L349 Elim1Store]: treesize reduction 633, result has 14.0 percent of original size [2023-11-29 06:24:28,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 12 new quantified variables, introduced 27 case distinctions, treesize of input 466 treesize of output 1383 [2023-11-29 06:24:31,169 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:31,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:31,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:31,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:31,212 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:31,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:31,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:31,227 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:31,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:31,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:31,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 69 [2023-11-29 06:24:32,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:32,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:32,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:32,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:32,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:32,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:32,423 INFO L349 Elim1Store]: treesize reduction 239, result has 28.0 percent of original size [2023-11-29 06:24:32,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 545 treesize of output 585 [2023-11-29 06:24:33,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:33,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:33,070 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:33,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:24:33,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:24:33,110 INFO L378 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 0 case distinctions, treesize of input 102 treesize of output 28 [2023-11-29 06:24:40,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:24:40,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 382 treesize of output 388 [2023-11-29 06:24:40,507 INFO L378 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 378 treesize of output 344 [2023-11-29 06:24:40,903 INFO L349 Elim1Store]: treesize reduction 20, result has 81.3 percent of original size [2023-11-29 06:24:40,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 539 treesize of output 573 [2023-11-29 06:24:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:42,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:24:59,827 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:25:10,829 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:25:18,757 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:25:26,771 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:25:34,812 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:26:17,582 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:26:23,753 WARN L293 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 06:26:37,435 WARN L293 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)