./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:16:31,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:16:31,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:16:31,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:16:31,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:16:31,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:16:31,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:16:31,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:16:31,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:16:31,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:16:31,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:16:31,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:16:31,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:16:31,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:16:31,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:16:31,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:16:31,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:16:31,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:16:31,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:16:31,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:16:31,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:16:31,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:16:31,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:16:31,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:16:31,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:16:31,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:16:31,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:16:31,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:16:31,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:16:31,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:16:31,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:16:31,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:16:31,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:16:31,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:16:31,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:16:31,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:16:31,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:16:31,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:16:31,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:16:31,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:16:31,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:16:31,502 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:16:31,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:16:31,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:16:31,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:16:31,546 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:16:31,547 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:16:31,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:16:31,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:16:31,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:16:31,549 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:16:31,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:16:31,550 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:16:31,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:16:31,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:16:31,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:16:31,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:16:31,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:16:31,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:16:31,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:16:31,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:16:31,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:16:31,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:16:31,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:16:31,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:16:31,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:16:31,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:16:31,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:16:31,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:16:31,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:16:31,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:16:31,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:16:31,557 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:16:31,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:16:31,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:16:31,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/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_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2022-11-16 11:16:31,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:16:31,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:16:31,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:16:31,902 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:16:31,903 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:16:31,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/array-fpi/s4if.c [2022-11-16 11:16:31,985 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/data/a03d524be/cb52e9cb1cd64f67a1572c33828ac611/FLAG96546d9f2 [2022-11-16 11:16:32,548 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:16:32,549 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/sv-benchmarks/c/array-fpi/s4if.c [2022-11-16 11:16:32,566 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/data/a03d524be/cb52e9cb1cd64f67a1572c33828ac611/FLAG96546d9f2 [2022-11-16 11:16:32,918 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/data/a03d524be/cb52e9cb1cd64f67a1572c33828ac611 [2022-11-16 11:16:32,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:16:32,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:16:32,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:16:32,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:16:32,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:16:32,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:16:32" (1/1) ... [2022-11-16 11:16:32,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b38b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:32, skipping insertion in model container [2022-11-16 11:16:32,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:16:32" (1/1) ... [2022-11-16 11:16:32,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:16:32,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:16:33,203 WARN L229 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_4e93c738-e7b4-4229-85ce-4b2024665cd8/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2022-11-16 11:16:33,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:16:33,242 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:16:33,256 WARN L229 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_4e93c738-e7b4-4229-85ce-4b2024665cd8/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2022-11-16 11:16:33,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:16:33,278 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:16:33,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33 WrapperNode [2022-11-16 11:16:33,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:16:33,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:16:33,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:16:33,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:16:33,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,314 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-11-16 11:16:33,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:16:33,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:16:33,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:16:33,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:16:33,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,338 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:16:33,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:16:33,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:16:33,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:16:33,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (1/1) ... [2022-11-16 11:16:33,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:16:33,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:33,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:16:33,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:16:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:16:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:16:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:16:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:16:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:16:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:16:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:16:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:16:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:16:33,523 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:16:33,526 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:16:33,752 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:16:33,757 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:16:33,757 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:16:33,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:16:33 BoogieIcfgContainer [2022-11-16 11:16:33,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:16:33,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:16:33,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:16:33,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:16:33,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:16:32" (1/3) ... [2022-11-16 11:16:33,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6ea62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:16:33, skipping insertion in model container [2022-11-16 11:16:33,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:16:33" (2/3) ... [2022-11-16 11:16:33,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6ea62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:16:33, skipping insertion in model container [2022-11-16 11:16:33,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:16:33" (3/3) ... [2022-11-16 11:16:33,785 INFO L112 eAbstractionObserver]: Analyzing ICFG s4if.c [2022-11-16 11:16:33,814 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:16:33,829 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:16:33,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:16:33,909 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35fa2094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:16:33,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:16:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:16:33,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:33,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:33,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:33,931 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-11-16 11:16:33,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:33,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580677842] [2022-11-16 11:16:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:33,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:34,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:34,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580677842] [2022-11-16 11:16:34,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580677842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:16:34,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:16:34,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:16:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525439964] [2022-11-16 11:16:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:16:34,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:16:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:16:34,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:16:34,225 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:34,240 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-11-16 11:16:34,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:16:34,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:16:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:34,252 INFO L225 Difference]: With dead ends: 34 [2022-11-16 11:16:34,252 INFO L226 Difference]: Without dead ends: 15 [2022-11-16 11:16:34,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:16:34,264 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:34,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:16:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-16 11:16:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-16 11:16:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-16 11:16:34,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-11-16 11:16:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:34,301 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-16 11:16:34,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-16 11:16:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:16:34,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:34,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:34,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:16:34,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-11-16 11:16:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:34,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39227723] [2022-11-16 11:16:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:34,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:34,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39227723] [2022-11-16 11:16:34,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39227723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:16:34,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:16:34,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:16:34,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167974835] [2022-11-16 11:16:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:16:34,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:16:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:34,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:16:34,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:16:34,525 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:34,606 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-16 11:16:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:16:34,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:16:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:34,608 INFO L225 Difference]: With dead ends: 28 [2022-11-16 11:16:34,608 INFO L226 Difference]: Without dead ends: 20 [2022-11-16 11:16:34,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:16:34,610 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:34,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:16:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-16 11:16:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-11-16 11:16:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-16 11:16:34,617 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-11-16 11:16:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:34,618 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-16 11:16:34,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-16 11:16:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:16:34,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:34,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:34,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:16:34,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-11-16 11:16:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:34,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399118025] [2022-11-16 11:16:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:35,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399118025] [2022-11-16 11:16:35,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399118025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:35,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151798789] [2022-11-16 11:16:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:35,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:35,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:35,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:16:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:35,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:16:35,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:35,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:16:35,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:16:35,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:16:35,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-16 11:16:36,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-16 11:16:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:36,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:36,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:36,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2022-11-16 11:16:36,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:16:36,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2022-11-16 11:16:36,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:16:36,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:16:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:36,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151798789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:36,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:16:36,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-11-16 11:16:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022987150] [2022-11-16 11:16:36,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:36,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:16:36,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:16:36,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=269, Unknown=2, NotChecked=0, Total=342 [2022-11-16 11:16:36,643 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:36,841 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-11-16 11:16:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:16:36,842 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:16:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:36,846 INFO L225 Difference]: With dead ends: 36 [2022-11-16 11:16:36,846 INFO L226 Difference]: Without dead ends: 32 [2022-11-16 11:16:36,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=346, Unknown=2, NotChecked=0, Total=462 [2022-11-16 11:16:36,852 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:36,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 49 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-11-16 11:16:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-16 11:16:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2022-11-16 11:16:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-16 11:16:36,864 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2022-11-16 11:16:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:36,864 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-16 11:16:36,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-16 11:16:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:16:36,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:36,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:36,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:37,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 11:16:37,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:37,072 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-11-16 11:16:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:37,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188654797] [2022-11-16 11:16:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:37,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:16:37,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125781975] [2022-11-16 11:16:37,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:37,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:37,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:37,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:37,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:16:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:37,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:16:37,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:37,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:16:37,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:16:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:37,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:37,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-16 11:16:37,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-16 11:16:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:37,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:37,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188654797] [2022-11-16 11:16:37,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:16:37,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125781975] [2022-11-16 11:16:37,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125781975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:37,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:16:37,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-16 11:16:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374262] [2022-11-16 11:16:37,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:37,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:16:37,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:37,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:16:37,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:16:37,288 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:37,383 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-16 11:16:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:16:37,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:16:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:37,385 INFO L225 Difference]: With dead ends: 38 [2022-11-16 11:16:37,385 INFO L226 Difference]: Without dead ends: 26 [2022-11-16 11:16:37,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:16:37,392 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:37,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:16:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-16 11:16:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-16 11:16:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-16 11:16:37,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-11-16 11:16:37,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:37,403 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-16 11:16:37,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-16 11:16:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:16:37,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:37,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:37,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:37,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:37,611 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-11-16 11:16:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:37,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617360452] [2022-11-16 11:16:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:37,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617360452] [2022-11-16 11:16:37,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617360452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612316057] [2022-11-16 11:16:37,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:16:37,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:37,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:37,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:37,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:16:37,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:16:37,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:16:37,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:16:37,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:37,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:37,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612316057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:37,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:16:37,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-16 11:16:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232389862] [2022-11-16 11:16:37,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:37,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:16:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:16:37,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:16:37,969 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:38,137 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-16 11:16:38,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:16:38,138 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 11:16:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:38,140 INFO L225 Difference]: With dead ends: 33 [2022-11-16 11:16:38,140 INFO L226 Difference]: Without dead ends: 29 [2022-11-16 11:16:38,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:16:38,142 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:38,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 25 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:16:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-16 11:16:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-11-16 11:16:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-16 11:16:38,157 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-11-16 11:16:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:38,157 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-16 11:16:38,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-16 11:16:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:16:38,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:38,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:38,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:38,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:38,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:38,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-11-16 11:16:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:38,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299307496] [2022-11-16 11:16:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:38,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:38,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299307496] [2022-11-16 11:16:38,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299307496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:38,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917565774] [2022-11-16 11:16:38,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:16:38,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:38,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:38,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:38,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:16:38,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:16:38,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:16:38,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:16:38,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:38,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:38,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917565774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:38,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:16:38,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-16 11:16:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441330216] [2022-11-16 11:16:38,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:38,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:16:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:16:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:16:38,654 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:38,758 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-11-16 11:16:38,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:16:38,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:16:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:38,759 INFO L225 Difference]: With dead ends: 37 [2022-11-16 11:16:38,759 INFO L226 Difference]: Without dead ends: 25 [2022-11-16 11:16:38,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:16:38,760 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:38,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:16:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-16 11:16:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-11-16 11:16:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-11-16 11:16:38,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-11-16 11:16:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:38,766 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-11-16 11:16:38,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-11-16 11:16:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:16:38,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:38,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:38,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:38,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 11:16:38,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-11-16 11:16:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:38,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788877647] [2022-11-16 11:16:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:38,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:39,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788877647] [2022-11-16 11:16:39,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788877647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:39,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154197419] [2022-11-16 11:16:39,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:16:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:39,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:39,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:16:39,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:16:39,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:16:39,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 11:16:39,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:39,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:16:39,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:16:39,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:16:39,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:16:40,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-16 11:16:40,290 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:16:40,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-16 11:16:40,539 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:16:40,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-11-16 11:16:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:40,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:46,321 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (not (= .cse0 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse6 .cse7 .cse8)) (not (= .cse8 4)) (not (= .cse6 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|))))))))) is different from false [2022-11-16 11:16:46,450 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse0 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse7 .cse8 .cse9)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse9 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse7 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))))) is different from false [2022-11-16 11:16:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-16 11:16:46,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154197419] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:46,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:16:46,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2022-11-16 11:16:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501726649] [2022-11-16 11:16:46,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:46,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 11:16:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 11:16:46,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=934, Unknown=4, NotChecked=126, Total=1190 [2022-11-16 11:16:46,609 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:47,603 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-11-16 11:16:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:16:47,604 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 11:16:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:47,606 INFO L225 Difference]: With dead ends: 43 [2022-11-16 11:16:47,606 INFO L226 Difference]: Without dead ends: 37 [2022-11-16 11:16:47,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=228, Invalid=1582, Unknown=4, NotChecked=166, Total=1980 [2022-11-16 11:16:47,608 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:47,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 86 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 155 Invalid, 0 Unknown, 189 Unchecked, 0.2s Time] [2022-11-16 11:16:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-16 11:16:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-11-16 11:16:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-16 11:16:47,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 21 [2022-11-16 11:16:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:47,617 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-16 11:16:47,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-16 11:16:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:16:47,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:47,618 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:47,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:47,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 11:16:47,824 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2022-11-16 11:16:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:47,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866712729] [2022-11-16 11:16:47,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:47,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:16:47,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737096669] [2022-11-16 11:16:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:47,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:47,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:47,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:16:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:47,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 11:16:47,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:48,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:16:48,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:48,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:16:48,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:16:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:48,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:48,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-11-16 11:16:48,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:48,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-16 11:16:48,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:48,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-16 11:16:48,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:16:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:16:48,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:48,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866712729] [2022-11-16 11:16:48,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:16:48,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737096669] [2022-11-16 11:16:48,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737096669] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:48,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:16:48,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-16 11:16:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304493013] [2022-11-16 11:16:48,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:48,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:16:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:16:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=4, NotChecked=24, Total=210 [2022-11-16 11:16:48,356 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:48,586 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-11-16 11:16:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:16:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 11:16:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:48,587 INFO L225 Difference]: With dead ends: 44 [2022-11-16 11:16:48,587 INFO L226 Difference]: Without dead ends: 37 [2022-11-16 11:16:48,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=4, NotChecked=32, Total=342 [2022-11-16 11:16:48,589 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:48,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 85 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-11-16 11:16:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-16 11:16:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-11-16 11:16:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-11-16 11:16:48,599 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 21 [2022-11-16 11:16:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:48,599 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-11-16 11:16:48,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-11-16 11:16:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:16:48,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:48,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:48,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:48,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:48,802 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-11-16 11:16:48,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:48,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079519310] [2022-11-16 11:16:48,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:48,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079519310] [2022-11-16 11:16:48,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079519310] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:48,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979322879] [2022-11-16 11:16:48,981 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:16:48,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:48,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:48,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:49,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:16:49,073 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-16 11:16:49,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:16:49,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:16:49,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:49,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:49,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979322879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:49,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:16:49,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-16 11:16:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411589073] [2022-11-16 11:16:49,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:49,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:16:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:16:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:16:49,316 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:49,572 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-11-16 11:16:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:16:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 11:16:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:49,573 INFO L225 Difference]: With dead ends: 44 [2022-11-16 11:16:49,573 INFO L226 Difference]: Without dead ends: 40 [2022-11-16 11:16:49,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:16:49,574 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:49,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:16:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-16 11:16:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-11-16 11:16:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-11-16 11:16:49,584 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 23 [2022-11-16 11:16:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:49,584 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-11-16 11:16:49,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-11-16 11:16:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:16:49,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:49,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:49,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:49,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:49,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash -981578845, now seen corresponding path program 2 times [2022-11-16 11:16:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:49,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146608585] [2022-11-16 11:16:49,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:49,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:16:49,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526215043] [2022-11-16 11:16:49,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:16:49,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:49,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:49,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:16:49,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:16:49,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:16:49,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:16:49,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:50,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:50,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146608585] [2022-11-16 11:16:50,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:16:50,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526215043] [2022-11-16 11:16:50,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526215043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:50,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:16:50,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-16 11:16:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881478403] [2022-11-16 11:16:50,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:50,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:16:50,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:50,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:16:50,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:16:50,096 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:50,270 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-16 11:16:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:16:50,271 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 11:16:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:50,272 INFO L225 Difference]: With dead ends: 48 [2022-11-16 11:16:50,272 INFO L226 Difference]: Without dead ends: 30 [2022-11-16 11:16:50,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:16:50,274 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:50,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:16:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-16 11:16:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-11-16 11:16:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-11-16 11:16:50,281 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-11-16 11:16:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:50,282 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-11-16 11:16:50,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:16:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-11-16 11:16:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:16:50,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:50,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:50,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:50,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:16:50,490 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2022-11-16 11:16:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:50,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903071129] [2022-11-16 11:16:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:51,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903071129] [2022-11-16 11:16:51,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903071129] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:51,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109785104] [2022-11-16 11:16:51,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:16:51,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:51,580 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:51,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:16:51,700 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-16 11:16:51,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:16:51,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 11:16:51,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:51,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:16:51,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:51,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:16:51,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:51,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:16:51,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:51,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:16:52,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:52,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-16 11:16:52,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:52,355 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:16:52,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-16 11:16:52,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:52,726 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-16 11:16:52,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 55 [2022-11-16 11:16:52,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:52,974 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-16 11:16:52,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 33 [2022-11-16 11:16:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:53,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:02,252 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse4)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ .cse1 .cse2 .cse3 .cse0) (+ 5 .cse4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse8 .cse9 .cse10 .cse7)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))))))))) is different from false [2022-11-16 11:17:02,439 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse1 .cse2 .cse3 .cse0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2022-11-16 11:17:02,757 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 11) (+ .cse1 .cse2 .cse3 .cse0)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2022-11-16 11:17:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-16 11:17:02,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109785104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:02,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:17:02,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2022-11-16 11:17:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125640619] [2022-11-16 11:17:02,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:02,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-16 11:17:02,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:02,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-16 11:17:02,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1720, Unknown=5, NotChecked=258, Total=2162 [2022-11-16 11:17:02,931 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:13,795 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-11-16 11:17:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:17:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 11:17:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:13,796 INFO L225 Difference]: With dead ends: 55 [2022-11-16 11:17:13,796 INFO L226 Difference]: Without dead ends: 44 [2022-11-16 11:17:13,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=381, Invalid=3532, Unknown=5, NotChecked=372, Total=4290 [2022-11-16 11:17:13,799 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:13,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 104 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 417 Unchecked, 0.3s Time] [2022-11-16 11:17:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-16 11:17:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-16 11:17:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-11-16 11:17:13,809 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 26 [2022-11-16 11:17:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:13,809 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-11-16 11:17:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-11-16 11:17:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:17:13,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:13,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:13,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:14,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:14,022 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:14,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 3 times [2022-11-16 11:17:14,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:14,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25503456] [2022-11-16 11:17:14,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:14,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:17:14,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826921059] [2022-11-16 11:17:14,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:17:14,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:14,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:14,067 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:14,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:17:14,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:17:14,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:14,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 11:17:14,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:14,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 11:17:14,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:14,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:17:14,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:14,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:17:14,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:17:14,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-16 11:17:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 11:17:14,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:15,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:17:15,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-16 11:17:15,646 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-16 11:17:15,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-11-16 11:17:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 11:17:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:17,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25503456] [2022-11-16 11:17:17,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:17:17,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826921059] [2022-11-16 11:17:17,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826921059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:17,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:17:17,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-11-16 11:17:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355391200] [2022-11-16 11:17:17,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:17,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:17:17,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:17:17,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=175, Unknown=3, NotChecked=0, Total=240 [2022-11-16 11:17:17,688 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:17,760 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-11-16 11:17:17,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:17:17,760 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 11:17:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:17,761 INFO L225 Difference]: With dead ends: 54 [2022-11-16 11:17:17,761 INFO L226 Difference]: Without dead ends: 50 [2022-11-16 11:17:17,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=76, Invalid=193, Unknown=3, NotChecked=0, Total=272 [2022-11-16 11:17:17,762 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:17,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 37 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-11-16 11:17:17,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-16 11:17:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-11-16 11:17:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-11-16 11:17:17,774 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 26 [2022-11-16 11:17:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:17,774 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-11-16 11:17:17,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-11-16 11:17:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:17:17,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:17,776 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:17,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:17,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 11:17:17,981 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 7 times [2022-11-16 11:17:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:17,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840628546] [2022-11-16 11:17:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:18,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840628546] [2022-11-16 11:17:18,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840628546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:18,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673148744] [2022-11-16 11:17:18,134 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 11:17:18,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:18,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:18,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:18,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:17:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:18,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:17:18,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:18,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:18,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673148744] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:18,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:17:18,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-16 11:17:18,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77596357] [2022-11-16 11:17:18,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:18,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:17:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:18,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:17:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:17:18,462 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:18,752 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-11-16 11:17:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:17:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-16 11:17:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:18,753 INFO L225 Difference]: With dead ends: 65 [2022-11-16 11:17:18,753 INFO L226 Difference]: Without dead ends: 61 [2022-11-16 11:17:18,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:17:18,754 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:18,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 28 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:17:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-16 11:17:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-11-16 11:17:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-11-16 11:17:18,767 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 28 [2022-11-16 11:17:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:18,768 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-11-16 11:17:18,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-11-16 11:17:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:17:18,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:18,769 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:18,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:18,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:18,975 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:18,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash -798779835, now seen corresponding path program 4 times [2022-11-16 11:17:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:18,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79919098] [2022-11-16 11:17:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:18,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:17:18,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219056842] [2022-11-16 11:17:18,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:17:18,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:18,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:18,989 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:19,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:17:19,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:17:19,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:19,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:17:19,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:19,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:19,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:19,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79919098] [2022-11-16 11:17:19,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:17:19,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219056842] [2022-11-16 11:17:19,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219056842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:19,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:17:19,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-16 11:17:19,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617916680] [2022-11-16 11:17:19,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:19,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:17:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:17:19,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:17:19,318 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:19,483 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-11-16 11:17:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:17:19,484 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-16 11:17:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:19,484 INFO L225 Difference]: With dead ends: 71 [2022-11-16 11:17:19,484 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 11:17:19,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:17:19,486 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:19,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 24 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:17:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 11:17:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-11-16 11:17:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-16 11:17:19,493 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2022-11-16 11:17:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:19,494 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-16 11:17:19,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-16 11:17:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 11:17:19,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:19,495 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:19,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:19,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:17:19,698 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 8 times [2022-11-16 11:17:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:19,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077673950] [2022-11-16 11:17:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:19,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:20,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077673950] [2022-11-16 11:17:20,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077673950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:20,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236400676] [2022-11-16 11:17:20,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:17:20,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:20,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:20,890 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:20,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:17:20,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:17:20,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:20,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 11:17:20,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:21,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:17:21,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:21,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:21,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:21,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:21,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:21,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:21,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:21,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:21,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:21,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-16 11:17:21,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:21,722 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:17:21,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-16 11:17:21,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:21,945 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:17:21,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2022-11-16 11:17:22,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:22,152 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:17:22,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-16 11:17:22,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:22,304 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:17:22,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2022-11-16 11:17:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:22,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:33,745 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_subst_6 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_144| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse0 .cse3 .cse4) (+ 5 .cse5)) (not (= 4 .cse4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_subst_5 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_145| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= .cse8 4)) (< (+ .cse5 3) (+ .cse9 .cse10 .cse11 .cse12 .cse8)) (not (= .cse11 4)) (not (= .cse9 4)) (not (= .cse12 4)))))))))))) is different from false [2022-11-16 11:17:33,896 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_subst_5 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_145| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (< (+ 7 .cse4) (+ .cse2 .cse5 .cse1 .cse3 .cse0)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_subst_6 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_144| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse8 4)) (not (= .cse9 4)) (< (+ .cse10 .cse9 .cse8 .cse11 .cse12) (+ .cse4 9)) (not (= 4 .cse12)) (not (= .cse11 4)))))))))))) is different from false [2022-11-16 11:17:34,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_subst_6 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_144| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse0 .cse3 .cse4) (+ .cse5 13)) (not (= 4 .cse4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_subst_5 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_145| 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= .cse8 4)) (not (= .cse9 4)) (not (= .cse10 4)) (not (= .cse11 4)) (< (+ .cse5 11) (+ .cse10 .cse12 .cse9 .cse11 .cse8)))))))))))) is different from false [2022-11-16 11:17:34,428 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_subst_6 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_144| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse0 .cse3 .cse4) (+ .cse5 17)) (not (= 4 .cse4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_subst_5 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_145| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= .cse8 4)) (< (+ .cse5 15) (+ .cse9 .cse10 .cse11 .cse12 .cse8)) (not (= .cse11 4)) (not (= .cse9 4)) (not (= .cse12 4)))))))))))) is different from false [2022-11-16 11:17:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-16 11:17:34,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236400676] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:34,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:17:34,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2022-11-16 11:17:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444933730] [2022-11-16 11:17:34,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:34,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-16 11:17:34,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-16 11:17:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2083, Unknown=7, NotChecked=380, Total=2652 [2022-11-16 11:17:34,572 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:35,621 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-11-16 11:17:35,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:17:35,622 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 11:17:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:35,622 INFO L225 Difference]: With dead ends: 58 [2022-11-16 11:17:35,622 INFO L226 Difference]: Without dead ends: 54 [2022-11-16 11:17:35,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=212, Invalid=2247, Unknown=7, NotChecked=396, Total=2862 [2022-11-16 11:17:35,624 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 465 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:35,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 144 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 240 Invalid, 0 Unknown, 465 Unchecked, 0.3s Time] [2022-11-16 11:17:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-16 11:17:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-11-16 11:17:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-11-16 11:17:35,638 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 31 [2022-11-16 11:17:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:35,638 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-11-16 11:17:35,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-11-16 11:17:35,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 11:17:35,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:35,640 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:35,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:35,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:17:35,845 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1338916473, now seen corresponding path program 5 times [2022-11-16 11:17:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:35,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088710221] [2022-11-16 11:17:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:35,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:17:35,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176958667] [2022-11-16 11:17:35,861 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:17:35,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:35,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:35,862 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:35,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:17:36,005 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-16 11:17:36,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:36,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 11:17:36,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:36,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:17:36,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 11:17:36,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:17:36,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 11:17:36,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:17:36,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:17:36,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:17:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:17:36,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:36,786 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-16 11:17:36,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-16 11:17:36,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:17:36,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-16 11:17:36,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:17:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:17:36,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:36,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088710221] [2022-11-16 11:17:36,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:17:36,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176958667] [2022-11-16 11:17:36,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176958667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:36,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:17:36,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-11-16 11:17:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65960983] [2022-11-16 11:17:36,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:36,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:17:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:17:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=420, Unknown=9, NotChecked=0, Total=506 [2022-11-16 11:17:36,907 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:37,284 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-11-16 11:17:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:17:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 11:17:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:37,285 INFO L225 Difference]: With dead ends: 61 [2022-11-16 11:17:37,285 INFO L226 Difference]: Without dead ends: 52 [2022-11-16 11:17:37,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=588, Unknown=9, NotChecked=0, Total=702 [2022-11-16 11:17:37,287 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:37,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 77 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 228 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2022-11-16 11:17:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-16 11:17:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-11-16 11:17:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-16 11:17:37,302 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2022-11-16 11:17:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:37,302 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-16 11:17:37,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-16 11:17:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 11:17:37,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:37,304 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:37,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:37,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:17:37,510 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:37,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 9 times [2022-11-16 11:17:37,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:37,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525285446] [2022-11-16 11:17:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:37,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525285446] [2022-11-16 11:17:37,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525285446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:37,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967008770] [2022-11-16 11:17:37,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:17:37,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:37,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:37,774 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:37,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:17:37,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-16 11:17:37,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:37,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:17:37,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:38,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967008770] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:38,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:17:38,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-11-16 11:17:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322284766] [2022-11-16 11:17:38,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:17:38,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:17:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:17:38,314 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:38,830 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-16 11:17:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:17:38,831 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-16 11:17:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:38,832 INFO L225 Difference]: With dead ends: 69 [2022-11-16 11:17:38,832 INFO L226 Difference]: Without dead ends: 65 [2022-11-16 11:17:38,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-11-16 11:17:38,833 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:38,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 31 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:17:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-16 11:17:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2022-11-16 11:17:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-16 11:17:38,857 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2022-11-16 11:17:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:38,857 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-16 11:17:38,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-16 11:17:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:17:38,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:38,858 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:38,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:39,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 11:17:39,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 10 times [2022-11-16 11:17:39,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:39,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254169526] [2022-11-16 11:17:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:39,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254169526] [2022-11-16 11:17:39,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254169526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:39,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009498902] [2022-11-16 11:17:39,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:17:39,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:39,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:39,293 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:39,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:17:39,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:17:39,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:39,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:17:39,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:39,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:17:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:39,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009498902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:17:39,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:17:39,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-11-16 11:17:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181913073] [2022-11-16 11:17:39,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:17:39,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:17:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:39,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:17:39,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:17:39,827 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:40,077 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-11-16 11:17:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:17:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-16 11:17:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:40,078 INFO L225 Difference]: With dead ends: 78 [2022-11-16 11:17:40,078 INFO L226 Difference]: Without dead ends: 50 [2022-11-16 11:17:40,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:17:40,079 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:40,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 25 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:17:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-16 11:17:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-11-16 11:17:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-11-16 11:17:40,091 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2022-11-16 11:17:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:40,091 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-11-16 11:17:40,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:17:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-11-16 11:17:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:17:40,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:40,092 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:17:40,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:40,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:40,298 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 11 times [2022-11-16 11:17:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:40,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67333210] [2022-11-16 11:17:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:42,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67333210] [2022-11-16 11:17:42,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67333210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:42,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540277476] [2022-11-16 11:17:42,049 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:17:42,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:42,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:42,050 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:42,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:17:42,200 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-16 11:17:42,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:42,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-16 11:17:42,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:42,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:17:42,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:17:42,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:42,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:42,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:42,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:42,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:17:42,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-16 11:17:43,153 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:17:43,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-16 11:17:43,597 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-16 11:17:43,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 59 [2022-11-16 11:17:44,184 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-16 11:17:44,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 74 [2022-11-16 11:17:44,876 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-16 11:17:44,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 90 [2022-11-16 11:17:49,808 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-16 11:17:49,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 44 [2022-11-16 11:17:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:17:49,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:18:26,375 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_215| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_217| Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_217| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_215| 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_214| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_213| 4))))) (or (< (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (+ 5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (not (<= |v_ULTIMATE.start_main_~i~0#1_213| (+ |v_ULTIMATE.start_main_~i~0#1_214| 1))) (not (= .cse3 4)) (< |v_ULTIMATE.start_main_~i~0#1_213| |c_ULTIMATE.start_main_~i~0#1|) (not (= .cse2 4)) (not (= .cse1 4)) (not (= 4 .cse5)) (not (<= |v_ULTIMATE.start_main_~i~0#1_216| (+ |v_ULTIMATE.start_main_~i~0#1_217| 1))) (not (= .cse0 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_214| (+ |v_ULTIMATE.start_main_~i~0#1_215| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_215| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_217| 0))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_215| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_217| Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_217| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse14 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_215| 4))))) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse9 .cse8 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_214| 4)))) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_213| 4))) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse9 .cse8 .cse14 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12)))) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_213| (+ |v_ULTIMATE.start_main_~i~0#1_214| 1))) (not (= .cse8 4)) (< |v_ULTIMATE.start_main_~i~0#1_213| |c_ULTIMATE.start_main_~i~0#1|) (not (= .cse9 4)) (not (= .cse10 4)) (not (= 4 .cse11)) (< (+ .cse12 3) (+ .cse13 .cse10 .cse9 .cse8 .cse14 .cse11)) (not (<= |v_ULTIMATE.start_main_~i~0#1_216| (+ |v_ULTIMATE.start_main_~i~0#1_217| 1))) (not (= .cse13 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_214| (+ |v_ULTIMATE.start_main_~i~0#1_215| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_215| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_217| 0)))))))))))) is different from false [2022-11-16 11:19:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 43 refuted. 12 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-16 11:19:09,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540277476] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:19:09,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:19:09,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 72 [2022-11-16 11:19:09,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369576116] [2022-11-16 11:19:09,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:19:09,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 11:19:09,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:19:09,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 11:19:09,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=4502, Unknown=87, NotChecked=138, Total=5112 [2022-11-16 11:19:09,117 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:30,792 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-11-16 11:19:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 11:19:30,792 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-16 11:19:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:30,793 INFO L225 Difference]: With dead ends: 69 [2022-11-16 11:19:30,793 INFO L226 Difference]: Without dead ends: 65 [2022-11-16 11:19:30,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 101.1s TimeCoverageRelationStatistics Valid=684, Invalid=7418, Unknown=92, NotChecked=178, Total=8372 [2022-11-16 11:19:30,795 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:30,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 286 Unchecked, 0.3s Time] [2022-11-16 11:19:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-16 11:19:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2022-11-16 11:19:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-11-16 11:19:30,804 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 36 [2022-11-16 11:19:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:30,805 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-11-16 11:19:30,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-11-16 11:19:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:19:30,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:30,805 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:30,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:31,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:19:31,007 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 83735393, now seen corresponding path program 6 times [2022-11-16 11:19:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:19:31,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881132922] [2022-11-16 11:19:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:19:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:19:31,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:19:31,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456910983] [2022-11-16 11:19:31,028 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:19:31,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:19:31,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:19:31,030 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:19:31,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:19:31,221 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-16 11:19:31,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:19:31,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 11:19:31,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:31,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:19:31,426 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:19:31,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 11:19:34,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:19:34,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-16 11:19:35,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:19:35,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-16 11:19:36,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:19:36,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-16 11:19:37,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:19:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:19:37,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:19:38,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-11-16 11:19:38,243 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-16 11:19:38,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-16 11:19:38,273 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-16 11:19:38,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2022-11-16 11:19:38,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:19:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 30 refuted. 2 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-16 11:19:38,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:19:38,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881132922] [2022-11-16 11:19:38,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:19:38,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456910983] [2022-11-16 11:19:38,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456910983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:19:38,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:19:38,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-11-16 11:19:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604373955] [2022-11-16 11:19:38,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:19:38,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 11:19:38,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:19:38,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 11:19:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=459, Unknown=15, NotChecked=44, Total=600 [2022-11-16 11:19:38,452 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:38,716 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-11-16 11:19:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:19:38,717 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-16 11:19:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:38,718 INFO L225 Difference]: With dead ends: 54 [2022-11-16 11:19:38,718 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 11:19:38,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=112, Invalid=689, Unknown=15, NotChecked=54, Total=870 [2022-11-16 11:19:38,719 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:38,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2022-11-16 11:19:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 11:19:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-16 11:19:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-11-16 11:19:38,736 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2022-11-16 11:19:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:38,736 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-11-16 11:19:38,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-11-16 11:19:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 11:19:38,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:38,738 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:38,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:38,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:19:38,945 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash 465948487, now seen corresponding path program 12 times [2022-11-16 11:19:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:19:38,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611672278] [2022-11-16 11:19:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:19:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:19:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:19:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:19:39,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:19:39,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611672278] [2022-11-16 11:19:39,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611672278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:19:39,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915956234] [2022-11-16 11:19:39,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:19:39,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:19:39,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:19:39,258 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:19:39,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:19:39,461 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-16 11:19:39,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:19:39,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:19:39,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:19:39,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:19:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:19:39,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915956234] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:19:39,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:19:39,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-11-16 11:19:39,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770291761] [2022-11-16 11:19:39,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:19:39,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:19:39,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:19:39,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:19:39,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:19:39,929 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:40,240 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-11-16 11:19:40,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:19:40,242 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-16 11:19:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:40,242 INFO L225 Difference]: With dead ends: 86 [2022-11-16 11:19:40,243 INFO L226 Difference]: Without dead ends: 55 [2022-11-16 11:19:40,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2022-11-16 11:19:40,244 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 82 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:40,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 32 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:19:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-16 11:19:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-11-16 11:19:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-16 11:19:40,255 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 39 [2022-11-16 11:19:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:40,256 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-16 11:19:40,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:19:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-16 11:19:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:19:40,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:40,257 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:40,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-16 11:19:40,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:19:40,464 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash -552579063, now seen corresponding path program 13 times [2022-11-16 11:19:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:19:40,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326937269] [2022-11-16 11:19:40,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:19:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:19:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:19:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:19:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:19:42,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326937269] [2022-11-16 11:19:42,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326937269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:19:42,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940651104] [2022-11-16 11:19:42,700 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 11:19:42,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:19:42,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:19:42,702 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:19:42,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:19:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:19:42,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-16 11:19:42,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:42,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:19:42,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:19:42,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:19:42,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:19:42,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:19:42,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:19:43,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:19:43,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:19:43,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-16 11:19:43,600 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:19:43,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-16 11:19:43,869 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:19:43,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-11-16 11:19:44,180 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-16 11:19:44,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-11-16 11:19:44,520 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-16 11:19:44,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-11-16 11:19:44,809 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:19:44,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-16 11:19:44,986 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:19:44,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2022-11-16 11:19:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:19:45,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:05,887 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse1 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse4 .cse1 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse5 4)) (< (+ .cse6 3) (+ .cse3 .cse2 .cse5 .cse4 .cse1 .cse7 .cse0)))))))))))) (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse14 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (< (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (+ 5 .cse6)) (not (= .cse13 4)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= 4 .cse16)) (not (= .cse15 4)) (not (= .cse10 4)))))))))))))) is different from false [2022-11-16 11:21:06,608 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (< (+ 7 .cse0) (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= 4 .cse7)) (not (= .cse5 4)) (not (= .cse2 4)) (not (= .cse1 4)) (not (= .cse4 4)) (not (= .cse3 4)))))))))))) (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10 .cse16 .cse14 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse16 .cse14 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse10 4)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= 4 .cse13)) (not (= .cse14 4)) (< (+ .cse15 .cse11 .cse12 .cse10 .cse16 .cse14 .cse13) (+ .cse0 9)) (not (= .cse15 4)))))))))))))) is different from false [2022-11-16 11:21:07,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse3 .cse0 .cse4 .cse5 .cse6) (+ .cse7 13)) (not (= .cse3 4)) (not (= 4 .cse6)) (not (= .cse5 4)) (not (= .cse2 4)))))))))))) (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse14 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse10)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse13 4)) (not (= .cse14 4)) (not (= .cse15 4)) (< (+ .cse7 11) (+ .cse13 .cse12 .cse15 .cse14 .cse11 .cse16 .cse10)))))))))))))) is different from false [2022-11-16 11:21:08,865 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse3 .cse0 .cse4 .cse5 .cse6) (+ .cse7 17)) (not (= .cse3 4)) (not (= 4 .cse6)) (not (= .cse5 4)) (not (= .cse2 4)))))))))))) (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse14 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse10)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse13 4)) (not (= .cse14 4)) (not (= .cse15 4)) (< (+ .cse7 15) (+ .cse13 .cse12 .cse15 .cse14 .cse11 .cse16 .cse10)))))))))))))) is different from false [2022-11-16 11:21:10,134 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= 4 .cse3)) (< (+ .cse4 .cse1 .cse2 .cse0 .cse5 .cse6 .cse3) (+ .cse7 21)) (not (= .cse6 4)) (not (= .cse4 4)))))))))))) (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse14 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse10)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse13 4)) (not (= .cse14 4)) (not (= .cse15 4)) (< (+ 19 .cse7) (+ .cse13 .cse12 .cse15 .cse14 .cse11 .cse16 .cse10)))))))))))))) is different from false [2022-11-16 11:21:11,305 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse0)) (< (+ 23 .cse1) (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse0)) (not (= .cse6 4)) (not (= .cse3 4)) (not (= .cse2 4)) (not (= .cse5 4)) (not (= .cse4 4)))))))))))) (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10 .cse16 .cse14 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse16 .cse14 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse10 4)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= 4 .cse13)) (not (= .cse14 4)) (not (= .cse15 4)) (< (+ .cse15 .cse11 .cse12 .cse10 .cse16 .cse14 .cse13) (+ .cse1 25)))))))))))))) is different from false [2022-11-16 11:21:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-11-16 11:21:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940651104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:11,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:21:11,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 24] total 66 [2022-11-16 11:21:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436048994] [2022-11-16 11:21:11,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:11,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 11:21:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:11,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 11:21:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3303, Unknown=30, NotChecked=726, Total=4290 [2022-11-16 11:21:11,890 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:17,599 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-11-16 11:21:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:21:17,600 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-16 11:21:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:17,601 INFO L225 Difference]: With dead ends: 74 [2022-11-16 11:21:17,601 INFO L226 Difference]: Without dead ends: 70 [2022-11-16 11:21:17,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 86.3s TimeCoverageRelationStatistics Valid=280, Invalid=3746, Unknown=30, NotChecked=774, Total=4830 [2022-11-16 11:21:17,604 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 499 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:17,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 161 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 387 Invalid, 0 Unknown, 499 Unchecked, 1.0s Time] [2022-11-16 11:21:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-16 11:21:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-11-16 11:21:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-11-16 11:21:17,630 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 41 [2022-11-16 11:21:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:17,630 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-11-16 11:21:17,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-11-16 11:21:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:21:17,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:17,632 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:17,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:17,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 11:21:17,838 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 127479307, now seen corresponding path program 7 times [2022-11-16 11:21:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:17,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503893269] [2022-11-16 11:21:17,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:17,854 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:21:17,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545517634] [2022-11-16 11:21:17,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 11:21:17,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:17,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:17,856 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:17,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:21:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:17,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 11:21:17,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:18,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:21:18,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 11:21:18,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:21:18,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:21:18,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:21:18,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:21:19,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:21:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:21:19,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:20,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (forall ((v_ArrVal_992 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) (forall ((v_ArrVal_993 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-11-16 11:21:20,201 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (forall ((v_ArrVal_993 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) (forall ((v_ArrVal_992 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)))) is different from false [2022-11-16 11:21:20,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_987 Int) (v_ArrVal_992 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_987)))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (not (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-11-16 11:21:20,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_987 Int) (v_ArrVal_992 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_987)))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (not (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-11-16 11:21:20,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:21:20,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 51 [2022-11-16 11:21:20,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:21:20,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66 [2022-11-16 11:21:20,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:21:20,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-16 11:21:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-11-16 11:21:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503893269] [2022-11-16 11:21:21,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:21:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545517634] [2022-11-16 11:21:21,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545517634] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:21,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:21:21,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2022-11-16 11:21:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010553357] [2022-11-16 11:21:21,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:21,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 11:21:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:21,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 11:21:21,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=709, Unknown=17, NotChecked=228, Total=1056 [2022-11-16 11:21:21,580 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:23,004 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-11-16 11:21:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:21:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-16 11:21:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:23,006 INFO L225 Difference]: With dead ends: 82 [2022-11-16 11:21:23,006 INFO L226 Difference]: Without dead ends: 73 [2022-11-16 11:21:23,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=102, Invalid=709, Unknown=17, NotChecked=228, Total=1056 [2022-11-16 11:21:23,007 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:23,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 115 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 427 Invalid, 0 Unknown, 363 Unchecked, 1.1s Time] [2022-11-16 11:21:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-16 11:21:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2022-11-16 11:21:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-16 11:21:23,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 41 [2022-11-16 11:21:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:23,037 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-16 11:21:23,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-16 11:21:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:21:23,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:23,039 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:23,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:23,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 11:21:23,251 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash -105011125, now seen corresponding path program 14 times [2022-11-16 11:21:23,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:23,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650282995] [2022-11-16 11:21:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:23,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:23,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:23,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650282995] [2022-11-16 11:21:23,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650282995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:21:23,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784297792] [2022-11-16 11:21:23,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:21:23,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:23,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:23,977 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:23,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 11:21:24,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:21:24,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:21:24,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:21:24,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:24,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:25,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784297792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:25,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:21:25,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-11-16 11:21:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499795644] [2022-11-16 11:21:25,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:25,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:21:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:21:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-11-16 11:21:25,380 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:26,959 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-11-16 11:21:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:21:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 11:21:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:26,961 INFO L225 Difference]: With dead ends: 90 [2022-11-16 11:21:26,961 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 11:21:26,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 11:21:26,963 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 82 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:26,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 25 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-16 11:21:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 11:21:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2022-11-16 11:21:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-11-16 11:21:26,992 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 43 [2022-11-16 11:21:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:26,992 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-11-16 11:21:26,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-11-16 11:21:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 11:21:26,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:26,993 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:27,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:27,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 11:21:27,200 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2029167523, now seen corresponding path program 15 times [2022-11-16 11:21:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:27,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73897463] [2022-11-16 11:21:27,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:27,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73897463] [2022-11-16 11:21:27,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73897463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:21:27,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036802185] [2022-11-16 11:21:27,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:21:27,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:27,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:27,934 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:27,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 11:21:28,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-16 11:21:28,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:21:28,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:21:28,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:28,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:29,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036802185] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:29,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:21:29,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-11-16 11:21:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186823751] [2022-11-16 11:21:29,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:29,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:21:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:21:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-11-16 11:21:29,474 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:30,263 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-11-16 11:21:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:21:30,263 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-16 11:21:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:30,264 INFO L225 Difference]: With dead ends: 97 [2022-11-16 11:21:30,264 INFO L226 Difference]: Without dead ends: 63 [2022-11-16 11:21:30,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 11:21:30,266 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 79 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:30,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 41 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:21:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-16 11:21:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-11-16 11:21:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-16 11:21:30,283 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 44 [2022-11-16 11:21:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:30,283 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-16 11:21:30,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:21:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-16 11:21:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:21:30,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:30,284 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:30,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:30,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 11:21:30,484 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:30,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:30,485 INFO L85 PathProgramCache]: Analyzing trace with hash -111213349, now seen corresponding path program 16 times [2022-11-16 11:21:30,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:30,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046455024] [2022-11-16 11:21:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:35,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:35,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046455024] [2022-11-16 11:21:35,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046455024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:21:35,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950340430] [2022-11-16 11:21:35,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:21:35,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:35,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:35,399 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:35,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e93c738-e7b4-4229-85ce-4b2024665cd8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 11:21:35,576 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:21:35,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:21:35,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-16 11:21:35,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:35,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:21:35,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:21:35,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:21:35,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:21:36,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:21:36,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:21:36,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:21:36,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:21:36,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:21:37,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-16 11:21:38,689 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:21:38,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-16 11:21:39,633 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-16 11:21:39,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 55 [2022-11-16 11:21:40,728 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-16 11:21:40,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 71 [2022-11-16 11:21:41,986 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-16 11:21:41,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 85 [2022-11-16 11:21:43,522 INFO L321 Elim1Store]: treesize reduction 180, result has 0.6 percent of original size [2022-11-16 11:21:43,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 99 [2022-11-16 11:21:46,605 INFO L321 Elim1Store]: treesize reduction 252, result has 0.4 percent of original size [2022-11-16 11:21:46,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 120 treesize of output 113 [2022-11-16 11:21:47,579 INFO L321 Elim1Store]: treesize reduction 252, result has 0.4 percent of original size [2022-11-16 11:21:47,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 113 treesize of output 45 [2022-11-16 11:21:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:47,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:24:17,751 WARN L233 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:25:16,550 WARN L233 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:25:19,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6 .cse7) (+ .cse8 13)) (not (= .cse4 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse7)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse5)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|)))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse19 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse17)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse18)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (< (+ .cse8 11) (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse18 .cse19 .cse17))))))))))))))) is different from false [2022-11-16 11:25:22,940 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse6 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse4 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse5)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse6)) (< (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse6 .cse7 .cse5) (+ .cse8 17)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|)))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (< (+ .cse8 15) (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse19)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse17)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|)))))))))))))) is different from false [2022-11-16 11:25:26,380 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (< (+ 19 .cse4) (+ .cse2 .cse3 .cse0 .cse5 .cse1 .cse6 .cse7 .cse8)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse5 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse8)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= 4 .cse6))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (< (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19) (+ .cse4 21)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse19)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= 4 .cse17))))))))))))))) is different from false [2022-11-16 11:25:29,557 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse4 (+ 5 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse9 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1 .cse9 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1 .cse7 .cse9 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= .cse5 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse6)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse7)) (< (+ 23 .cse8) (+ .cse2 .cse3 .cse0 .cse5 .cse1 .cse7 .cse9 .cse6))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (< (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19) (+ .cse8 25)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse19)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse17))))))))))))))) is different from false [2022-11-16 11:25:32,656 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (< (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6 .cse7) (+ .cse8 29)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= .cse4 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse7)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse5))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse19 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse17)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse18)) (< (+ .cse8 27) (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse18 .cse19 .cse17))))))))))))))) is different from false [2022-11-16 11:25:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2022-11-16 11:25:34,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950340430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:34,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:25:34,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 96 [2022-11-16 11:25:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411529729] [2022-11-16 11:25:34,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:34,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-11-16 11:25:34,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:34,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-11-16 11:25:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=7615, Unknown=19, NotChecked=910, Total=9120 [2022-11-16 11:25:34,179 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 96 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 96 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:26:46,065 WARN L233 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:27:22,568 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:28:03,570 WARN L233 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:28:45,034 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:30:42,080 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:31:30,849 WARN L233 SmtUtils]: Spent 14.13s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)