./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s5lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s5lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro --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 ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- 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-8393723 [2022-11-18 18:24:34,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:24:34,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:24:34,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:24:34,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:24:34,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:24:34,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:24:34,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:24:34,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:24:34,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:24:34,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:24:34,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:24:34,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:24:34,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:24:34,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:24:34,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:24:34,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:24:34,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:24:34,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:24:34,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:24:34,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:24:34,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:24:34,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:24:34,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:24:34,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:24:34,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:24:34,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:24:34,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:24:34,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:24:34,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:24:34,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:24:34,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:24:34,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:24:34,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:24:34,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:24:34,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:24:34,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:24:34,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:24:34,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:24:34,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:24:34,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:24:34,417 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 18:24:34,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:24:34,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:24:34,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:24:34,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:24:34,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:24:34,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:24:34,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:24:34,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:24:34,463 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:24:34,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:24:34,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:24:34,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:24:34,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:24:34,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:24:34,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:24:34,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:24:34,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:24:34,466 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:24:34,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:24:34,466 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:24:34,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:24:34,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:24:34,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:24:34,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:24:34,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:24:34,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:24:34,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:24:34,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:24:34,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:24:34,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:24:34,469 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:24:34,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:24:34,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:24:34,469 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_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/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_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro 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 -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2022-11-18 18:24:34,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:24:34,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:24:34,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:24:34,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:24:34,787 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:24:34,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/array-fpi/s5lif.c [2022-11-18 18:24:34,873 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data/67c6d7127/9a6b0f57918843e58528093f93b8e345/FLAG730b014ef [2022-11-18 18:24:35,426 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:24:35,426 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/sv-benchmarks/c/array-fpi/s5lif.c [2022-11-18 18:24:35,436 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data/67c6d7127/9a6b0f57918843e58528093f93b8e345/FLAG730b014ef [2022-11-18 18:24:35,769 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data/67c6d7127/9a6b0f57918843e58528093f93b8e345 [2022-11-18 18:24:35,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:24:35,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:24:35,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:24:35,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:24:35,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:24:35,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:24:35" (1/1) ... [2022-11-18 18:24:35,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c676b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:35, skipping insertion in model container [2022-11-18 18:24:35,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:24:35" (1/1) ... [2022-11-18 18:24:35,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:24:35,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:24:35,991 WARN L234 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_c237bc23-1029-4062-a415-9f10713a65cd/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-11-18 18:24:36,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:24:36,023 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:24:36,037 WARN L234 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_c237bc23-1029-4062-a415-9f10713a65cd/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-11-18 18:24:36,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:24:36,061 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:24:36,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36 WrapperNode [2022-11-18 18:24:36,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:24:36,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:24:36,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:24:36,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:24:36,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,098 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-11-18 18:24:36,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:24:36,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:24:36,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:24:36,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:24:36,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:24:36,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:24:36,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:24:36,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:24:36,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (1/1) ... [2022-11-18 18:24:36,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:24:36,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:36,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:24:36,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:24:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:24:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:24:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:24:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:24:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 18:24:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:24:36,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:24:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 18:24:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:24:36,305 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:24:36,307 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:24:36,463 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:24:36,469 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:24:36,470 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 18:24:36,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:24:36 BoogieIcfgContainer [2022-11-18 18:24:36,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:24:36,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:24:36,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:24:36,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:24:36,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:24:35" (1/3) ... [2022-11-18 18:24:36,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc33746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:24:36, skipping insertion in model container [2022-11-18 18:24:36,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:24:36" (2/3) ... [2022-11-18 18:24:36,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc33746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:24:36, skipping insertion in model container [2022-11-18 18:24:36,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:24:36" (3/3) ... [2022-11-18 18:24:36,481 INFO L112 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-11-18 18:24:36,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:24:36,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 18:24:36,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:24:36,624 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;@6bacb12e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:24:36,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 18:24:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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-18 18:24:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:24:36,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:36,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:36,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:36,662 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-18 18:24:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:36,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436121580] [2022-11-18 18:24:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:36,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:36,911 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-18 18:24:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:36,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436121580] [2022-11-18 18:24:36,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436121580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:36,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:36,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:24:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439625464] [2022-11-18 18:24:36,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:36,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 18:24:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:36,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 18:24:36,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:24:36,968 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-18 18:24:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:36,993 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-18 18:24:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 18:24:36,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-11-18 18:24:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:37,009 INFO L225 Difference]: With dead ends: 40 [2022-11-18 18:24:37,009 INFO L226 Difference]: Without dead ends: 18 [2022-11-18 18:24:37,045 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-18 18:24:37,063 INFO L413 NwaCegarLoop]: 26 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, 26 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-18 18:24:37,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:24:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-18 18:24:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-18 18:24:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-18 18:24:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-18 18:24:37,127 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-18 18:24:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:37,128 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-18 18:24:37,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-18 18:24:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-18 18:24:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:24:37,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:37,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:37,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:24:37,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:37,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-18 18:24:37,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:37,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374178198] [2022-11-18 18:24:37,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:37,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:37,378 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-18 18:24:37,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:37,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374178198] [2022-11-18 18:24:37,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374178198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:37,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:37,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:24:37,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487191269] [2022-11-18 18:24:37,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:37,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:24:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:24:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:24:37,387 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-18 18:24:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:37,474 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-18 18:24:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:24:37,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-18 18:24:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:37,475 INFO L225 Difference]: With dead ends: 36 [2022-11-18 18:24:37,476 INFO L226 Difference]: Without dead ends: 25 [2022-11-18 18:24:37,476 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-18 18:24:37,477 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:37,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:24:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-18 18:24:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-18 18:24:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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-18 18:24:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-18 18:24:37,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-18 18:24:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:37,494 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-18 18:24:37,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-18 18:24:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-18 18:24:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 18:24:37,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:37,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:37,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:24:37,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-18 18:24:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:37,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594264804] [2022-11-18 18:24:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:37,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594264804] [2022-11-18 18:24:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594264804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:38,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154824472] [2022-11-18 18:24:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:38,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:38,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:38,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:38,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 18:24:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:38,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-18 18:24:38,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:38,983 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-18 18:24:38,995 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-18 18:24:39,045 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-18 18:24:39,209 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 32 treesize of output 23 [2022-11-18 18:24:39,371 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 36 treesize of output 23 [2022-11-18 18:24:39,481 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 43 treesize of output 27 [2022-11-18 18:24:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:39,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:39,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:39,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 44 [2022-11-18 18:24:40,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:40,055 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 59 treesize of output 52 [2022-11-18 18:24:40,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:40,065 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 46 treesize of output 34 [2022-11-18 18:24:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:40,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154824472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:40,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:40,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-11-18 18:24:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466868513] [2022-11-18 18:24:40,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:40,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 18:24:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 18:24:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-11-18 18:24:40,085 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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-18 18:24:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:40,746 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-18 18:24:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 18:24:40,747 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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 20 [2022-11-18 18:24:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:40,749 INFO L225 Difference]: With dead ends: 46 [2022-11-18 18:24:40,749 INFO L226 Difference]: Without dead ends: 42 [2022-11-18 18:24:40,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2022-11-18 18:24:40,751 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:40,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 61 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 182 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2022-11-18 18:24:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-18 18:24:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-18 18:24:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 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-18 18:24:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-18 18:24:40,764 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-11-18 18:24:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:40,765 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-18 18:24:40,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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-18 18:24:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-18 18:24:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 18:24:40,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:40,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:40,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:40,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:40,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-18 18:24:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:40,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467055673] [2022-11-18 18:24:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:41,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467055673] [2022-11-18 18:24:41,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467055673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:41,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836730779] [2022-11-18 18:24:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:41,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:41,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:41,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:41,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 18:24:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:41,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 18:24:41,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:41,367 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 18 treesize of output 14 [2022-11-18 18:24:41,401 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-18 18:24:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:41,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:41,444 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-18 18:24:41,447 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-18 18:24:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:41,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836730779] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:41,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:41,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-18 18:24:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234567476] [2022-11-18 18:24:41,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:41,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 18:24:41,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:41,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 18:24:41,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:24:41,475 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-18 18:24:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:41,570 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-11-18 18:24:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:24:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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 20 [2022-11-18 18:24:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:41,575 INFO L225 Difference]: With dead ends: 48 [2022-11-18 18:24:41,575 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 18:24:41,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:24:41,583 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:41,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 43 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:24:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 18:24:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-11-18 18:24:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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-18 18:24:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-18 18:24:41,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-11-18 18:24:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:41,603 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-18 18:24:41,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-18 18:24:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-18 18:24:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 18:24:41,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:41,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:41,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:41,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:41,811 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-18 18:24:41,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:41,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537792901] [2022-11-18 18:24:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:41,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:41,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537792901] [2022-11-18 18:24:41,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537792901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:41,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187922023] [2022-11-18 18:24:41,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:24:41,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:41,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:41,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:41,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 18:24:41,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:24:41,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:24:41,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 18:24:41,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:42,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:42,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187922023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:42,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:42,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-18 18:24:42,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315492692] [2022-11-18 18:24:42,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:42,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 18:24:42,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:42,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 18:24:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:24:42,156 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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-18 18:24:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:42,307 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-18 18:24:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:24:42,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 22 [2022-11-18 18:24:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:42,309 INFO L225 Difference]: With dead ends: 70 [2022-11-18 18:24:42,309 INFO L226 Difference]: Without dead ends: 44 [2022-11-18 18:24:42,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 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-18 18:24:42,310 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:42,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:24:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-18 18:24:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-11-18 18:24:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-18 18:24:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-18 18:24:42,331 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-18 18:24:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:42,332 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-18 18:24:42,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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-18 18:24:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-18 18:24:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 18:24:42,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:42,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:42,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 18:24:42,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:42,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:42,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-18 18:24:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:42,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738481880] [2022-11-18 18:24:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:42,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738481880] [2022-11-18 18:24:42,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738481880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395860881] [2022-11-18 18:24:42,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 18:24:42,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:42,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:42,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:42,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 18:24:42,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 18:24:42,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:24:42,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 18:24:42,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:42,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:42,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395860881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:42,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:42,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-18 18:24:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143639047] [2022-11-18 18:24:42,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:42,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 18:24:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 18:24:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:24:42,900 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-18 18:24:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:43,049 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-18 18:24:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:24:43,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 22 [2022-11-18 18:24:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:43,052 INFO L225 Difference]: With dead ends: 39 [2022-11-18 18:24:43,053 INFO L226 Difference]: Without dead ends: 31 [2022-11-18 18:24:43,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 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-18 18:24:43,055 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:43,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 24 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:24:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-18 18:24:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-18 18:24:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-18 18:24:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-18 18:24:43,063 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-11-18 18:24:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:43,064 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-18 18:24:43,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-18 18:24:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-18 18:24:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 18:24:43,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:43,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:43,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:43,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:43,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:43,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-18 18:24:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:43,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118930127] [2022-11-18 18:24:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:45,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:45,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118930127] [2022-11-18 18:24:45,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118930127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:45,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880873349] [2022-11-18 18:24:45,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 18:24:45,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:45,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:45,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:45,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 18:24:45,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 18:24:45,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:24:45,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-18 18:24:45,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:45,183 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-18 18:24:45,192 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-18 18:24:45,240 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-18 18:24:45,294 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-18 18:24:45,530 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-18 18:24:45,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:45,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-11-18 18:24:45,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:45,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:45,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-11-18 18:24:46,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-11-18 18:24:46,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-11-18 18:24:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:46,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:47,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:47,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-11-18 18:24:56,682 WARN L233 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:25:05,855 WARN L233 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:25:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:25:05,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880873349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:05,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:05,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 49 [2022-11-18 18:25:05,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716002758] [2022-11-18 18:25:05,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:05,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-18 18:25:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:05,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-18 18:25:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1995, Unknown=0, NotChecked=0, Total=2352 [2022-11-18 18:25:05,989 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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-18 18:25:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:27,151 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-11-18 18:25:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-18 18:25:27,151 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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 27 [2022-11-18 18:25:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:27,152 INFO L225 Difference]: With dead ends: 83 [2022-11-18 18:25:27,152 INFO L226 Difference]: Without dead ends: 77 [2022-11-18 18:25:27,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2008 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=1090, Invalid=5552, Unknown=0, NotChecked=0, Total=6642 [2022-11-18 18:25:27,156 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 112 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:27,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 98 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 605 Invalid, 0 Unknown, 50 Unchecked, 2.6s Time] [2022-11-18 18:25:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-18 18:25:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2022-11-18 18:25:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 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-18 18:25:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-11-18 18:25:27,172 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 27 [2022-11-18 18:25:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:27,172 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-11-18 18:25:27,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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-18 18:25:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-11-18 18:25:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 18:25:27,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:27,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:27,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 18:25:27,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:27,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:25:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-18 18:25:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:27,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211685875] [2022-11-18 18:25:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:25:28,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:28,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211685875] [2022-11-18 18:25:28,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211685875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:28,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131454428] [2022-11-18 18:25:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:28,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:28,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 18:25:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:28,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 18:25:28,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:28,223 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-18 18:25:28,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:28,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 18:25:28,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 18:25:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:25:28,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:28,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-18 18:25:28,589 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 20 treesize of output 16 [2022-11-18 18:25:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:25:28,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131454428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:28,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:28,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-11-18 18:25:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616626157] [2022-11-18 18:25:28,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:28,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 18:25:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 18:25:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-18 18:25:28,667 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:25:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:29,203 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2022-11-18 18:25:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 18:25:29,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-18 18:25:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:29,205 INFO L225 Difference]: With dead ends: 78 [2022-11-18 18:25:29,205 INFO L226 Difference]: Without dead ends: 54 [2022-11-18 18:25:29,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:25:29,206 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:29,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:25:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-18 18:25:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-11-18 18:25:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 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-18 18:25:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-11-18 18:25:29,222 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 27 [2022-11-18 18:25:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:29,223 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-11-18 18:25:29,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:25:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-11-18 18:25:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 18:25:29,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:29,225 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:29,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 18:25:29,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:29,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:25:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-11-18 18:25:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:29,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824681853] [2022-11-18 18:25:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 18:25:29,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:29,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824681853] [2022-11-18 18:25:29,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824681853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:29,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860970762] [2022-11-18 18:25:29,688 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 18:25:29,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:29,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:29,691 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:29,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 18:25:29,812 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-18 18:25:29,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:25:29,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 18:25:29,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 18:25:30,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 18:25:30,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860970762] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:30,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:30,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-18 18:25:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030919049] [2022-11-18 18:25:30,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:30,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 18:25:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 18:25:30,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-18 18:25:30,364 INFO L87 Difference]: Start difference. First operand 48 states and 57 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-18 18:25:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:30,853 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2022-11-18 18:25:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:25:30,854 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 29 [2022-11-18 18:25:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:30,855 INFO L225 Difference]: With dead ends: 91 [2022-11-18 18:25:30,855 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 18:25:30,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:25:30,856 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:30,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 34 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:25:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 18:25:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-11-18 18:25:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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-18 18:25:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-18 18:25:30,870 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-11-18 18:25:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:30,870 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-18 18:25:30,871 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-18 18:25:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-18 18:25:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 18:25:30,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:30,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:30,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 18:25:31,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:31,085 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:25:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-11-18 18:25:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:31,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342466273] [2022-11-18 18:25:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:25:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:31,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342466273] [2022-11-18 18:25:31,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342466273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:31,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927212096] [2022-11-18 18:25:31,344 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 18:25:31,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:31,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:31,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:31,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 18:25:31,445 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-18 18:25:31,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:25:31,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 18:25:31,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 18:25:31,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 18:25:31,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927212096] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:31,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:31,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-18 18:25:31,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452368948] [2022-11-18 18:25:31,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:31,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 18:25:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 18:25:31,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-18 18:25:31,935 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-18 18:25:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:32,444 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-18 18:25:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 18:25:32,445 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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) Word has length 29 [2022-11-18 18:25:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:32,446 INFO L225 Difference]: With dead ends: 48 [2022-11-18 18:25:32,446 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 18:25:32,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-18 18:25:32,447 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:32,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 30 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:25:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 18:25:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-18 18:25:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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-18 18:25:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-18 18:25:32,458 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-11-18 18:25:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:32,458 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-18 18:25:32,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-18 18:25:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-18 18:25:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 18:25:32,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:32,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:32,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 18:25:32,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 18:25:32,672 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:25:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:32,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-11-18 18:25:32,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:32,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818183164] [2022-11-18 18:25:32,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:25:37,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818183164] [2022-11-18 18:25:37,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818183164] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166560312] [2022-11-18 18:25:37,496 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 18:25:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:37,498 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:37,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 18:25:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:37,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-18 18:25:37,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:37,647 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-18 18:25:37,662 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-18 18:25:37,691 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-18 18:25:37,771 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-18 18:25:37,830 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-18 18:25:38,383 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-18 18:25:38,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:38,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-11-18 18:25:39,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:39,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:39,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-11-18 18:25:39,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:39,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:39,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:39,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-18 18:25:40,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:40,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:40,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:40,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:40,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-11-18 18:25:40,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2022-11-18 18:25:41,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2022-11-18 18:25:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:25:41,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:48,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:25:48,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-11-18 18:25:51,309 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse1) 6)) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4 .cse5))))) (+ .cse6 1)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (< .cse6 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10 1)))))) (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse1) 6)))))) is different from false [2022-11-18 18:25:54,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse3 .cse4))))) (+ 7 .cse6)) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse5) 6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (< (+ .cse6 5) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10)))))) (not (= (select v_arrayElimArr_4 .cse5) 6)))))) is different from false [2022-11-18 18:25:57,335 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (< (+ .cse1 11) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4 .cse5)))))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse6) 6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 6 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (not (= (select v_arrayElimArr_4 .cse6) 6)) (< (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse9 .cse10))))) (+ .cse1 13)))))) is different from false [2022-11-18 18:25:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-18 18:25:57,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166560312] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:57,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:57,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 62 [2022-11-18 18:25:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562464666] [2022-11-18 18:25:57,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:57,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-18 18:25:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-18 18:25:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3009, Unknown=3, NotChecked=348, Total=3782 [2022-11-18 18:25:57,591 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 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-18 18:26:48,424 WARN L233 SmtUtils]: Spent 17.15s on a formula simplification. DAG size of input: 71 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:27:42,042 WARN L233 SmtUtils]: Spent 14.84s on a formula simplification. DAG size of input: 72 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:28:10,807 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 162 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:28:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:28:11,587 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-11-18 18:28:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 18:28:11,588 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 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-18 18:28:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:28:11,589 INFO L225 Difference]: With dead ends: 84 [2022-11-18 18:28:11,589 INFO L226 Difference]: Without dead ends: 70 [2022-11-18 18:28:11,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 146.0s TimeCoverageRelationStatistics Valid=712, Invalid=4678, Unknown=24, NotChecked=438, Total=5852 [2022-11-18 18:28:11,593 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:28:11,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 133 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 938 Invalid, 0 Unknown, 241 Unchecked, 7.2s Time] [2022-11-18 18:28:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-18 18:28:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2022-11-18 18:28:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 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-18 18:28:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-11-18 18:28:11,610 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 34 [2022-11-18 18:28:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:28:11,610 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-11-18 18:28:11,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 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-18 18:28:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-11-18 18:28:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 18:28:11,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:28:11,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:28:11,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-18 18:28:11,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 18:28:11,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:28:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:28:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-11-18 18:28:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:28:11,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453227283] [2022-11-18 18:28:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:28:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:28:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:28:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:28:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:28:13,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453227283] [2022-11-18 18:28:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453227283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:28:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469833808] [2022-11-18 18:28:13,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:28:13,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:28:13,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:28:13,332 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:28:13,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 18:28:13,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:28:13,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:28:13,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 18:28:13,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:28:13,938 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-18 18:28:14,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:14,386 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 25 treesize of output 24 [2022-11-18 18:28:14,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:14,611 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 25 treesize of output 24 [2022-11-18 18:28:14,787 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-18 18:28:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:28:14,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:28:15,564 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 16 treesize of output 14 [2022-11-18 18:28:15,573 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 20 treesize of output 16 [2022-11-18 18:28:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:28:15,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469833808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:28:15,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:28:15,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-11-18 18:28:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947314715] [2022-11-18 18:28:15,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:28:15,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 18:28:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:28:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 18:28:15,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-11-18 18:28:15,856 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 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-18 18:28:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:28:19,156 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-11-18 18:28:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 18:28:19,157 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 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 34 [2022-11-18 18:28:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:28:19,158 INFO L225 Difference]: With dead ends: 77 [2022-11-18 18:28:19,158 INFO L226 Difference]: Without dead ends: 62 [2022-11-18 18:28:19,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-11-18 18:28:19,161 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-18 18:28:19,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 82 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-18 18:28:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-18 18:28:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-11-18 18:28:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 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-18 18:28:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-18 18:28:19,179 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-11-18 18:28:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:28:19,179 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-18 18:28:19,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 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-18 18:28:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-18 18:28:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 18:28:19,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:28:19,181 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:28:19,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 18:28:19,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 18:28:19,387 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:28:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:28:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-11-18 18:28:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:28:19,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750850003] [2022-11-18 18:28:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:28:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:28:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:28:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 18:28:20,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:28:20,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750850003] [2022-11-18 18:28:20,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750850003] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:28:20,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522816880] [2022-11-18 18:28:20,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:28:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:28:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:28:20,083 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:28:20,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 18:28:20,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:28:20,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:28:20,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 18:28:20,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:28:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 18:28:21,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:28:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 18:28:21,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522816880] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:28:21,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:28:21,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-18 18:28:21,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087426812] [2022-11-18 18:28:21,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:28:21,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 18:28:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:28:21,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 18:28:21,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:28:21,844 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-18 18:28:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:28:23,065 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-11-18 18:28:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:28:23,065 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-18 18:28:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:28:23,066 INFO L225 Difference]: With dead ends: 99 [2022-11-18 18:28:23,066 INFO L226 Difference]: Without dead ends: 62 [2022-11-18 18:28:23,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-18 18:28:23,068 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 106 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 18:28:23,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 30 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-18 18:28:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-18 18:28:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-18 18:28:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-18 18:28:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-18 18:28:23,084 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-11-18 18:28:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:28:23,085 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-18 18:28:23,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-18 18:28:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-18 18:28:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 18:28:23,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:28:23,086 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:28:23,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 18:28:23,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:28:23,293 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:28:23,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:28:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-11-18 18:28:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:28:23,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604916046] [2022-11-18 18:28:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:28:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:28:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:28:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:28:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:28:24,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604916046] [2022-11-18 18:28:24,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604916046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:28:24,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34970872] [2022-11-18 18:28:24,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 18:28:24,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:28:24,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:28:24,031 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:28:24,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 18:28:24,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 18:28:24,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:28:24,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 18:28:24,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:28:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:28:24,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:28:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:28:25,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34970872] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:28:25,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:28:25,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-18 18:28:25,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818054455] [2022-11-18 18:28:25,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:28:25,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 18:28:25,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:28:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 18:28:25,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:28:25,423 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 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-18 18:28:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:28:27,002 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-11-18 18:28:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 18:28:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-18 18:28:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:28:27,003 INFO L225 Difference]: With dead ends: 57 [2022-11-18 18:28:27,003 INFO L226 Difference]: Without dead ends: 45 [2022-11-18 18:28:27,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-18 18:28:27,005 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:28:27,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 36 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 18:28:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-18 18:28:27,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-11-18 18:28:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 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-18 18:28:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-18 18:28:27,017 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-11-18 18:28:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:28:27,018 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-18 18:28:27,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 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-18 18:28:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-18 18:28:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 18:28:27,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:28:27,019 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:28:27,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 18:28:27,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:28:27,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:28:27,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:28:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-11-18 18:28:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:28:27,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889544558] [2022-11-18 18:28:27,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:28:27,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:28:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:28:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:28:37,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:28:37,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889544558] [2022-11-18 18:28:37,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889544558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:28:37,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34501300] [2022-11-18 18:28:37,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 18:28:37,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:28:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:28:37,896 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:28:37,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 18:28:38,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 18:28:38,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:28:38,023 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-18 18:28:38,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:28:38,042 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-18 18:28:38,078 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-18 18:28:38,105 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-18 18:28:38,272 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-18 18:28:38,380 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-18 18:28:38,490 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-18 18:28:39,558 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-18 18:28:40,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-11-18 18:28:42,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:42,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:42,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:42,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-11-18 18:28:43,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:43,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:43,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:43,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-11-18 18:28:44,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:28:44,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:44,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:44,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:44,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-11-18 18:28:45,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:45,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:45,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:45,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:45,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:28:45,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:45,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:45,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-11-18 18:28:46,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:46,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:46,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:46,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:46,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:46,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:28:46,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:28:46,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-11-18 18:28:47,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-11-18 18:28:48,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 41 [2022-11-18 18:28:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:28:48,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:29:22,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:29:22,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 2288 treesize of output 520 [2022-11-18 18:29:25,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse8 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse6 .cse7)))))) (+ 7 .cse9)) (not (= 6 (select v_arrayElimArr_5 .cse8))) (not (= 6 .cse6))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (< (+ .cse9 5) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse14 .cse15))))))) (not (= 6 (select v_arrayElimArr_5 .cse8))) (not (= 6 .cse14))))))) is different from false [2022-11-18 18:29:28,265 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (+ .cse9 13)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= (select v_arrayElimArr_5 .cse7) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (not (= 6 .cse4))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= (select v_arrayElimArr_5 .cse7) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (< (+ .cse9 11) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse14 .cse15))))))) (not (= 6 .cse14))))))) is different from false [2022-11-18 18:29:31,483 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (not (= 6 (select v_arrayElimArr_5 .cse2))) (not (= 6 .cse3)) (< (+ .cse4 17) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse5 .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse9)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (not (= (select v_arrayElimArr_5 .cse1) 6)) (not (= 6 (select v_arrayElimArr_5 .cse2))) (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse14 .cse15)))))) (+ 19 .cse4)) (not (= 6 .cse14))))))) is different from false [2022-11-18 18:29:34,754 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ 23 .cse0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6))))))) (not (= (select v_arrayElimArr_5 .cse9) 6)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse7))) (not (= 6 .cse5))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse9) 6)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse7))) (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15)))))) (+ .cse0 25)) (not (= 6 .cse14))))))) is different from false [2022-11-18 18:29:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-18 18:29:35,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34501300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:29:35,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:29:35,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 79 [2022-11-18 18:29:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513676879] [2022-11-18 18:29:35,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:29:35,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-18 18:29:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:29:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-18 18:29:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=5026, Unknown=4, NotChecked=596, Total=6162 [2022-11-18 18:29:35,176 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 79 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 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-18 18:29:45,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-18 18:29:45,068 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-18 18:29:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:29:45,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 55.7s TimeCoverageRelationStatistics Valid=536, Invalid=5026, Unknown=4, NotChecked=596, Total=6162 [2022-11-18 18:29:45,071 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:29:45,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 14 Unchecked, 1.6s Time] [2022-11-18 18:29:45,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 18:29:45,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 18:29:45,272 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 48 more [2022-11-18 18:29:45,278 INFO L158 Benchmark]: Toolchain (without parser) took 309504.58ms. Allocated memory was 136.3MB in the beginning and 276.8MB in the end (delta: 140.5MB). Free memory was 103.9MB in the beginning and 214.1MB in the end (delta: -110.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2022-11-18 18:29:45,278 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 86.0MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:29:45,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.96ms. Allocated memory is still 136.3MB. Free memory was 103.7MB in the beginning and 112.3MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 18:29:45,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.50ms. Allocated memory is still 136.3MB. Free memory was 112.3MB in the beginning and 110.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:29:45,279 INFO L158 Benchmark]: Boogie Preprocessor took 31.43ms. Allocated memory is still 136.3MB. Free memory was 110.6MB in the beginning and 108.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:29:45,279 INFO L158 Benchmark]: RCFGBuilder took 340.69ms. Allocated memory is still 136.3MB. Free memory was 108.9MB in the beginning and 97.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 18:29:45,279 INFO L158 Benchmark]: TraceAbstraction took 308803.39ms. Allocated memory was 136.3MB in the beginning and 276.8MB in the end (delta: 140.5MB). Free memory was 96.7MB in the beginning and 214.1MB in the end (delta: -117.4MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-11-18 18:29:45,281 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 86.0MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.96ms. Allocated memory is still 136.3MB. Free memory was 103.7MB in the beginning and 112.3MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.50ms. Allocated memory is still 136.3MB. Free memory was 112.3MB in the beginning and 110.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.43ms. Allocated memory is still 136.3MB. Free memory was 110.6MB in the beginning and 108.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.69ms. Allocated memory is still 136.3MB. Free memory was 108.9MB in the beginning and 97.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 308803.39ms. Allocated memory was 136.3MB in the beginning and 276.8MB in the end (delta: 140.5MB). Free memory was 96.7MB in the beginning and 214.1MB in the end (delta: -117.4MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s5lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro --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 ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- 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-8393723 [2022-11-18 18:29:47,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:29:47,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:29:47,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:29:47,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:29:47,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:29:47,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:29:47,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:29:47,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:29:47,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:29:47,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:29:47,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:29:47,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:29:47,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:29:47,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:29:47,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:29:47,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:29:47,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:29:47,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:29:47,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:29:47,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:29:47,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:29:47,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:29:47,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:29:47,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:29:47,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:29:47,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:29:47,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:29:47,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:29:47,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:29:47,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:29:47,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:29:47,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:29:47,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:29:47,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:29:47,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:29:47,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:29:47,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:29:47,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:29:47,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:29:47,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:29:47,502 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-18 18:29:47,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:29:47,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:29:47,544 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:29:47,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:29:47,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:29:47,546 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:29:47,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:29:47,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:29:47,548 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:29:47,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:29:47,549 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:29:47,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:29:47,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:29:47,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:29:47,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:29:47,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:29:47,551 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 18:29:47,552 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 18:29:47,552 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 18:29:47,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:29:47,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:29:47,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:29:47,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:29:47,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:29:47,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:29:47,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:29:47,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:29:47,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:29:47,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:29:47,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:29:47,556 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 18:29:47,556 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 18:29:47,556 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:29:47,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:29:47,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:29:47,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 18:29:47,557 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/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_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro 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 -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2022-11-18 18:29:47,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:29:47,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:29:47,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:29:47,975 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:29:47,976 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:29:47,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/array-fpi/s5lif.c [2022-11-18 18:29:48,055 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data/53213d87d/95566b4b68a24b90995d49fbf5cbedb1/FLAGe6d1627c4 [2022-11-18 18:29:48,540 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:29:48,548 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/sv-benchmarks/c/array-fpi/s5lif.c [2022-11-18 18:29:48,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data/53213d87d/95566b4b68a24b90995d49fbf5cbedb1/FLAGe6d1627c4 [2022-11-18 18:29:48,931 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/data/53213d87d/95566b4b68a24b90995d49fbf5cbedb1 [2022-11-18 18:29:48,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:29:48,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:29:48,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:29:48,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:29:48,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:29:48,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:29:48" (1/1) ... [2022-11-18 18:29:48,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d09ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:48, skipping insertion in model container [2022-11-18 18:29:48,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:29:48" (1/1) ... [2022-11-18 18:29:48,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:29:48,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:29:49,105 WARN L234 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_c237bc23-1029-4062-a415-9f10713a65cd/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-11-18 18:29:49,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:29:49,143 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:29:49,184 WARN L234 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_c237bc23-1029-4062-a415-9f10713a65cd/sv-benchmarks/c/array-fpi/s5lif.c[588,601] [2022-11-18 18:29:49,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:29:49,256 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:29:49,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49 WrapperNode [2022-11-18 18:29:49,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:29:49,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:29:49,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:29:49,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:29:49,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,324 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-11-18 18:29:49,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:29:49,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:29:49,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:29:49,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:29:49,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,376 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:29:49,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:29:49,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:29:49,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:29:49,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (1/1) ... [2022-11-18 18:29:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:29:49,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:29:49,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:29:49,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:29:49,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:29:49,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 18:29:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:29:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-18 18:29:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 18:29:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 18:29:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:29:49,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:29:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-18 18:29:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:29:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 18:29:49,573 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:29:49,575 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:29:49,882 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:29:49,888 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:29:49,888 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 18:29:49,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:29:49 BoogieIcfgContainer [2022-11-18 18:29:49,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:29:49,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:29:49,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:29:49,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:29:49,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:29:48" (1/3) ... [2022-11-18 18:29:49,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85a39df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:29:49, skipping insertion in model container [2022-11-18 18:29:49,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:29:49" (2/3) ... [2022-11-18 18:29:49,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85a39df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:29:49, skipping insertion in model container [2022-11-18 18:29:49,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:29:49" (3/3) ... [2022-11-18 18:29:49,913 INFO L112 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-11-18 18:29:49,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:29:49,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 18:29:50,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:29:50,050 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;@7e2c196f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:29:50,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 18:29:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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-18 18:29:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:29:50,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:29:50,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:29:50,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:29:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:29:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-18 18:29:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:29:50,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472933653] [2022-11-18 18:29:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:29:50,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:29:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:29:50,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:29:50,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 18:29:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:29:50,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 18:29:50,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:29:50,273 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-18 18:29:50,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:29:50,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:29:50,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472933653] [2022-11-18 18:29:50,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472933653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:29:50,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:29:50,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:29:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454875205] [2022-11-18 18:29:50,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:29:50,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 18:29:50,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:29:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 18:29:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:29:50,322 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-18 18:29:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:29:50,344 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-18 18:29:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 18:29:50,347 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-11-18 18:29:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:29:50,363 INFO L225 Difference]: With dead ends: 40 [2022-11-18 18:29:50,363 INFO L226 Difference]: Without dead ends: 18 [2022-11-18 18:29:50,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-18 18:29:50,369 INFO L413 NwaCegarLoop]: 26 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, 26 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-18 18:29:50,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:29:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-18 18:29:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-18 18:29:50,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-18 18:29:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-18 18:29:50,403 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-18 18:29:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:29:50,403 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-18 18:29:50,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-18 18:29:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-18 18:29:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:29:50,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:29:50,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:29:50,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-18 18:29:50,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:29:50,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:29:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:29:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-18 18:29:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:29:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490836128] [2022-11-18 18:29:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:29:50,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:29:50,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:29:50,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:29:50,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 18:29:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:29:50,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 18:29:50,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:29:50,956 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-18 18:29:50,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:29:50,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:29:50,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490836128] [2022-11-18 18:29:50,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490836128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:29:50,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:29:50,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:29:50,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073808809] [2022-11-18 18:29:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:29:50,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:29:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:29:50,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:29:50,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:29:50,961 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 18:29:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:29:51,145 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-18 18:29:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:29:51,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-11-18 18:29:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:29:51,147 INFO L225 Difference]: With dead ends: 36 [2022-11-18 18:29:51,147 INFO L226 Difference]: Without dead ends: 25 [2022-11-18 18:29:51,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:29:51,149 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:29:51,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:29:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-18 18:29:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-18 18:29:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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-18 18:29:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-18 18:29:51,157 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-18 18:29:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:29:51,158 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-18 18:29:51,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 18:29:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-18 18:29:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 18:29:51,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:29:51,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:29:51,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 18:29:51,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:29:51,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:29:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:29:51,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-18 18:29:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:29:51,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445767274] [2022-11-18 18:29:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:29:51,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:29:51,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:29:51,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:29:51,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 18:29:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:29:51,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 18:29:51,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:29:51,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:29:51,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-18 18:29:51,641 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-18 18:29:51,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:29:51,771 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 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-18 18:29:52,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:29:52,195 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 43 treesize of output 37 [2022-11-18 18:29:52,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:29:52,509 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 82 treesize of output 47 [2022-11-18 18:29:52,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:29:52,764 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 86 treesize of output 52 [2022-11-18 18:29:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:29:52,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:29:59,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:29:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:29:59,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:29:59,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445767274] [2022-11-18 18:29:59,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445767274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:29:59,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:29:59,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-18 18:29:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242715223] [2022-11-18 18:29:59,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:29:59,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 18:29:59,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:29:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 18:29:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=448, Unknown=1, NotChecked=0, Total=552 [2022-11-18 18:29:59,673 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 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-18 18:30:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:30:04,797 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-11-18 18:30:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 18:30:04,804 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 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 20 [2022-11-18 18:30:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:30:04,805 INFO L225 Difference]: With dead ends: 50 [2022-11-18 18:30:04,806 INFO L226 Difference]: Without dead ends: 40 [2022-11-18 18:30:04,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=251, Invalid=1008, Unknown=1, NotChecked=0, Total=1260 [2022-11-18 18:30:04,812 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-18 18:30:04,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 57 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 261 Invalid, 0 Unknown, 47 Unchecked, 1.8s Time] [2022-11-18 18:30:04,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-18 18:30:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-11-18 18:30:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 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-18 18:30:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-18 18:30:04,826 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-11-18 18:30:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:30:04,827 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-18 18:30:04,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 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-18 18:30:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-18 18:30:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 18:30:04,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:30:04,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:30:04,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 18:30:05,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:30:05,040 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:30:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:30:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-18 18:30:05,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:30:05,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506392233] [2022-11-18 18:30:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:30:05,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:30:05,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:30:05,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:30:05,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 18:30:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:30:05,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 18:30:05,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:30:05,133 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-18 18:30:05,186 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-18 18:30:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:30:05,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:30:05,264 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-18 18:30:05,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-18 18:30:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:30:05,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:30:05,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506392233] [2022-11-18 18:30:05,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506392233] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:30:05,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:30:05,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-18 18:30:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223547066] [2022-11-18 18:30:05,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:30:05,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:30:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:30:05,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:30:05,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:30:05,299 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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-18 18:30:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:30:05,530 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-11-18 18:30:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:30:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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) Word has length 20 [2022-11-18 18:30:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:30:05,532 INFO L225 Difference]: With dead ends: 49 [2022-11-18 18:30:05,532 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 18:30:05,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:30:05,533 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:30:05,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:30:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 18:30:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-18 18:30:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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-18 18:30:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-18 18:30:05,544 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2022-11-18 18:30:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:30:05,545 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-18 18:30:05,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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-18 18:30:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-18 18:30:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 18:30:05,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:30:05,546 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:30:05,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 18:30:05,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:30:05,759 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:30:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:30:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-18 18:30:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:30:05,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504253116] [2022-11-18 18:30:05,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:30:05,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:30:05,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:30:05,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:30:05,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 18:30:05,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:30:05,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:30:05,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 18:30:05,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:30:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:30:06,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:30:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:30:06,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:30:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504253116] [2022-11-18 18:30:06,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504253116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:30:06,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:30:06,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-11-18 18:30:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025739729] [2022-11-18 18:30:06,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:30:06,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 18:30:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:30:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 18:30:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-18 18:30:06,406 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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-18 18:30:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:30:07,162 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-11-18 18:30:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:30:07,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 22 [2022-11-18 18:30:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:30:07,164 INFO L225 Difference]: With dead ends: 63 [2022-11-18 18:30:07,164 INFO L226 Difference]: Without dead ends: 40 [2022-11-18 18:30:07,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-18 18:30:07,166 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:30:07,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 23 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:30:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-18 18:30:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2022-11-18 18:30:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-18 18:30:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-18 18:30:07,175 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-18 18:30:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:30:07,176 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-18 18:30:07,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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-18 18:30:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-18 18:30:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 18:30:07,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:30:07,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:30:07,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 18:30:07,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:30:07,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:30:07,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:30:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-18 18:30:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:30:07,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278915418] [2022-11-18 18:30:07,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 18:30:07,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:30:07,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:30:07,392 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:30:07,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 18:30:07,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 18:30:07,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:30:07,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 18:30:07,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:30:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:30:07,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:30:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:30:08,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:30:08,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278915418] [2022-11-18 18:30:08,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278915418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:30:08,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:30:08,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-11-18 18:30:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711809827] [2022-11-18 18:30:08,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:30:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 18:30:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:30:08,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 18:30:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-11-18 18:30:08,258 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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-18 18:30:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:30:09,414 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-11-18 18:30:09,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 18:30:09,415 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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 22 [2022-11-18 18:30:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:30:09,416 INFO L225 Difference]: With dead ends: 72 [2022-11-18 18:30:09,416 INFO L226 Difference]: Without dead ends: 57 [2022-11-18 18:30:09,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-11-18 18:30:09,417 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 217 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:30:09,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 23 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:30:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-18 18:30:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-11-18 18:30:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 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-18 18:30:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-11-18 18:30:09,430 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 22 [2022-11-18 18:30:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:30:09,431 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-11-18 18:30:09,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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-18 18:30:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-11-18 18:30:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 18:30:09,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:30:09,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:30:09,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 18:30:09,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:30:09,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:30:09,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:30:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-18 18:30:09,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:30:09,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013503520] [2022-11-18 18:30:09,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 18:30:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:30:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:30:09,656 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:30:09,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 18:30:09,788 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 18:30:09,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:30:09,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-18 18:30:09,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:30:09,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:30:09,882 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 18 treesize of output 19 [2022-11-18 18:30:09,906 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-18 18:30:09,981 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 25 treesize of output 25 [2022-11-18 18:30:10,092 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 25 treesize of output 25 [2022-11-18 18:30:10,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:30:10,650 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-18 18:30:11,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:30:11,041 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 2 case distinctions, treesize of input 56 treesize of output 49 [2022-11-18 18:30:11,475 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 18:30:11,475 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 4 case distinctions, treesize of input 99 treesize of output 70 [2022-11-18 18:30:11,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:30:11,855 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 2 case distinctions, treesize of input 117 treesize of output 73 [2022-11-18 18:30:12,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:30:12,211 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 2 case distinctions, treesize of input 151 treesize of output 83 [2022-11-18 18:30:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:30:12,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:30:57,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:30:57,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 653 treesize of output 289 [2022-11-18 18:31:07,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:07,739 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 18:31:07,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 562 treesize of output 1 [2022-11-18 18:31:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:31:07,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:31:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013503520] [2022-11-18 18:31:07,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013503520] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:31:07,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:31:07,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2022-11-18 18:31:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092057595] [2022-11-18 18:31:07,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:31:07,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-18 18:31:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:31:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-18 18:31:07,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1060, Unknown=15, NotChecked=0, Total=1260 [2022-11-18 18:31:07,744 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-18 18:31:25,637 WARN L233 SmtUtils]: Spent 12.60s on a formula simplification. DAG size of input: 77 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:31:45,907 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 75 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:32:09,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:32:18,836 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 64 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:32:21,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:32:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:32:24,768 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-11-18 18:32:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 18:32:24,768 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-18 18:32:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:32:24,769 INFO L225 Difference]: With dead ends: 62 [2022-11-18 18:32:24,769 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 18:32:24,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 124.7s TimeCoverageRelationStatistics Valid=460, Invalid=2591, Unknown=29, NotChecked=0, Total=3080 [2022-11-18 18:32:24,771 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:32:24,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 60 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 335 Invalid, 2 Unknown, 227 Unchecked, 7.5s Time] [2022-11-18 18:32:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 18:32:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-11-18 18:32:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 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-18 18:32:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-18 18:32:24,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2022-11-18 18:32:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:32:24,783 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-18 18:32:24,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-18 18:32:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-18 18:32:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 18:32:24,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:32:24,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:32:24,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 18:32:24,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:32:24,996 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:32:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:32:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-18 18:32:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:32:24,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487802692] [2022-11-18 18:32:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:32:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:32:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:32:24,999 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:32:25,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-18 18:32:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:32:25,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 18:32:25,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:32:25,151 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-18 18:32:25,330 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 18:32:25,331 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-18 18:32:25,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 18:32:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:32:25,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:32:25,657 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 16 treesize of output 14 [2022-11-18 18:32:25,665 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 20 treesize of output 16 [2022-11-18 18:32:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:32:25,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:32:25,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487802692] [2022-11-18 18:32:25,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487802692] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:32:25,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:32:25,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-11-18 18:32:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611283414] [2022-11-18 18:32:25,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:32:25,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 18:32:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:32:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 18:32:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:32:25,775 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-18 18:32:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:32:26,525 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-18 18:32:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:32:26,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 27 [2022-11-18 18:32:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:32:26,527 INFO L225 Difference]: With dead ends: 69 [2022-11-18 18:32:26,527 INFO L226 Difference]: Without dead ends: 40 [2022-11-18 18:32:26,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-11-18 18:32:26,528 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:32:26,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 18:32:26,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-18 18:32:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-18 18:32:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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-18 18:32:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-18 18:32:26,537 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2022-11-18 18:32:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:32:26,537 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-18 18:32:26,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-18 18:32:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-18 18:32:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 18:32:26,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:32:26,543 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:32:26,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-18 18:32:26,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:32:26,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:32:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:32:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 5 times [2022-11-18 18:32:26,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:32:26,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742062645] [2022-11-18 18:32:26,757 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 18:32:26,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:32:26,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:32:26,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:32:26,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-18 18:32:26,885 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-18 18:32:26,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:32:26,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 18:32:26,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:32:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:32:27,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:32:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:32:29,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:32:29,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742062645] [2022-11-18 18:32:29,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742062645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:32:29,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:32:29,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-11-18 18:32:29,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053496474] [2022-11-18 18:32:29,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:32:29,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 18:32:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:32:29,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 18:32:29,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-11-18 18:32:29,204 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 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-18 18:32:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:32:32,325 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-11-18 18:32:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 18:32:32,326 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 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) Word has length 29 [2022-11-18 18:32:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:32:32,327 INFO L225 Difference]: With dead ends: 88 [2022-11-18 18:32:32,327 INFO L226 Difference]: Without dead ends: 69 [2022-11-18 18:32:32,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-11-18 18:32:32,328 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 392 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:32:32,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 25 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-18 18:32:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-18 18:32:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-11-18 18:32:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 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-18 18:32:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-18 18:32:32,350 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2022-11-18 18:32:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:32:32,351 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-18 18:32:32,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 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-18 18:32:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-18 18:32:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 18:32:32,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:32:32,353 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:32:32,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-18 18:32:32,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:32:32,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:32:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:32:32,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 6 times [2022-11-18 18:32:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:32:32,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339487315] [2022-11-18 18:32:32,567 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 18:32:32,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:32:32,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:32:32,568 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:32:32,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-18 18:32:32,763 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-18 18:32:32,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:32:32,771 WARN L261 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-18 18:32:32,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:32:32,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:32,936 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 18 treesize of output 19 [2022-11-18 18:32:32,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-18 18:32:33,064 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 25 treesize of output 25 [2022-11-18 18:32:33,247 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 25 treesize of output 25 [2022-11-18 18:32:33,418 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 25 treesize of output 25 [2022-11-18 18:32:34,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:32:34,098 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-18 18:32:34,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:32:34,726 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 2 case distinctions, treesize of input 67 treesize of output 56 [2022-11-18 18:32:35,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:32:35,482 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 4 case distinctions, treesize of input 65 treesize of output 61 [2022-11-18 18:32:36,233 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-18 18:32:36,234 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 7 case distinctions, treesize of input 108 treesize of output 82 [2022-11-18 18:32:36,876 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-18 18:32:36,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 7 case distinctions, treesize of input 130 treesize of output 96 [2022-11-18 18:32:38,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:32:38,003 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 4 case distinctions, treesize of input 174 treesize of output 113 [2022-11-18 18:32:38,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:32:38,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 212 treesize of output 142 [2022-11-18 18:32:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:38,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:34:50,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:34:50,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 3961 treesize of output 1239 [2022-11-18 18:35:16,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:16,590 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 18:35:16,590 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 2506 treesize of output 1 [2022-11-18 18:35:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:16,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:16,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339487315] [2022-11-18 18:35:16,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339487315] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:35:16,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:35:16,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2022-11-18 18:35:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752094659] [2022-11-18 18:35:16,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:35:16,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-18 18:35:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-18 18:35:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1825, Unknown=28, NotChecked=0, Total=2162 [2022-11-18 18:35:16,596 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 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-18 18:35:29,350 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse77 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse76 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse77)) (.cse72 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse73 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse77))) (let ((.cse60 (select .cse72 .cse73)) (.cse71 (select .cse72 .cse76))) (let ((.cse29 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse77)) (.cse16 (store .cse72 .cse76 (bvadd .cse71 (_ bv5 32)))) (.cse74 (bvadd .cse60 (_ bv5 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse11 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse46 (store .cse16 .cse73 .cse74)) (.cse2 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse75 (select .cse72 .cse29))) (let ((.cse31 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse30 (bvadd .cse75 (_ bv5 32))) (.cse32 (not (= .cse75 (_ bv1 32)))) (.cse34 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse0 (bvule c_~N~0 (_ bv536870911 32))) (.cse28 (store .cse72 .cse73 .cse74)) (.cse47 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse1 (not (= .cse71 (_ bv1 32)))) (.cse48 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse49 (= (let ((.cse61 (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse69 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse70 (bvadd (concat (select .cse69 .cse7) (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse68 ((_ extract 31 0) .cse70)) (.cse67 ((_ extract 63 32) .cse70))) (let ((.cse65 (store (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse68) .cse7 .cse67))) (let ((.cse66 (bvadd ((_ sign_extend 32) (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse65) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse67 .cse68)))) (let ((.cse63 ((_ extract 31 0) .cse66)) (.cse62 ((_ extract 63 32) .cse66))) (bvadd (concat .cse62 .cse63) ((_ sign_extend 32) (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse63) .cse7 .cse62)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse2)) (.cse33 (not (= .cse60 (_ bv1 32))))) (and (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (not (bvslt (_ bv3 32) c_~N~0)) (or .cse1 (= .cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse14 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (bvadd ((_ sign_extend 32) (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse14 .cse7) (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse13 ((_ extract 31 0) .cse15)) (.cse12 ((_ extract 63 32) .cse15))) (let ((.cse5 (store (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13) .cse7 .cse12))) (let ((.cse10 (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse12 .cse13)))) (let ((.cse8 ((_ extract 63 32) .cse10)) (.cse6 ((_ extract 31 0) .cse10))) (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse6) .cse7 .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (concat .cse8 .cse6))))))))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3)))) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (or (= (let ((.cse17 (let ((.cse27 (store .cse28 .cse29 .cse30))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse25 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (bvadd ((_ sign_extend 32) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse25 .cse7) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse24 ((_ extract 31 0) .cse26)) (.cse23 ((_ extract 63 32) .cse26))) (let ((.cse21 (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24) .cse7 .cse23))) (let ((.cse22 (bvadd (concat .cse23 .cse24) ((_ sign_extend 32) (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))))) (let ((.cse19 ((_ extract 31 0) .cse22)) (.cse18 ((_ extract 63 32) .cse22))) (bvadd (concat .cse18 .cse19) ((_ sign_extend 32) (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19) .cse7 .cse18)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))))))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) .cse2) .cse31 .cse32 .cse33) (or .cse31 .cse34 (= .cse2 (let ((.cse35 (let ((.cse45 (store .cse46 .cse29 .cse30))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse43 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (bvadd ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse43 .cse7) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse44)) (.cse41 ((_ extract 63 32) .cse44))) (let ((.cse39 (store (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42) .cse7 .cse41))) (let ((.cse40 (bvadd ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse41 .cse42)))) (let ((.cse37 ((_ extract 31 0) .cse40)) (.cse36 ((_ extract 63 32) .cse40))) (bvadd (concat .cse36 .cse37) ((_ sign_extend 32) (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse37) .cse7 .cse36)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35)))) .cse32 .cse33) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) (_ bv0 64)) (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or .cse34 .cse48 .cse49 .cse33) .cse0 (or (= .cse2 (let ((.cse50 (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (let ((.cse58 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (bvadd (concat (select .cse58 .cse7) (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse57 ((_ extract 31 0) .cse59)) (.cse56 ((_ extract 63 32) .cse59))) (let ((.cse54 (store (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse57) .cse7 .cse56))) (let ((.cse55 (bvadd ((_ sign_extend 32) (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse54) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (concat .cse56 .cse57)))) (let ((.cse52 ((_ extract 31 0) .cse55)) (.cse51 ((_ extract 63 32) .cse55))) (bvadd (concat .cse51 .cse52) ((_ sign_extend 32) (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52) .cse7 .cse51)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))) .cse48 .cse33) (= (select .cse47 .cse7) ((_ extract 63 32) (_ bv0 64))) (or .cse1 .cse48 .cse49 .cse33)))))))) is different from true [2022-11-18 18:35:58,619 WARN L233 SmtUtils]: Spent 10.84s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:36:18,897 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 132 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:36:21,168 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse75 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse74 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse75)) (.cse70 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse71 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse75))) (let ((.cse58 (select .cse70 .cse71)) (.cse69 (select .cse70 .cse74))) (let ((.cse28 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse75)) (.cse15 (store .cse70 .cse74 (bvadd .cse69 (_ bv5 32)))) (.cse72 (bvadd .cse58 (_ bv5 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse45 (store .cse15 .cse71 .cse72)) (.cse1 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse73 (select .cse70 .cse28))) (let ((.cse30 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse29 (bvadd .cse73 (_ bv5 32))) (.cse31 (not (= .cse73 (_ bv1 32)))) (.cse33 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse27 (store .cse70 .cse71 .cse72)) (.cse0 (not (= .cse69 (_ bv1 32)))) (.cse46 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse47 (= (let ((.cse59 (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse67 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (bvadd (concat (select .cse67 .cse6) (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse66 ((_ extract 31 0) .cse68)) (.cse65 ((_ extract 63 32) .cse68))) (let ((.cse63 (store (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse66) .cse6 .cse65))) (let ((.cse64 (bvadd ((_ sign_extend 32) (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse65 .cse66)))) (let ((.cse61 ((_ extract 31 0) .cse64)) (.cse60 ((_ extract 63 32) .cse64))) (bvadd (concat .cse60 .cse61) ((_ sign_extend 32) (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse61) .cse6 .cse60)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse1)) (.cse32 (not (= .cse58 (_ bv1 32))))) (and (or .cse0 (= .cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (bvadd ((_ sign_extend 32) (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse13 .cse6) (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse12 ((_ extract 31 0) .cse14)) (.cse11 ((_ extract 63 32) .cse14))) (let ((.cse4 (store (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12) .cse6 .cse11))) (let ((.cse9 (bvadd ((_ sign_extend 32) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse11 .cse12)))) (let ((.cse7 ((_ extract 63 32) .cse9)) (.cse5 ((_ extract 31 0) .cse9))) (bvadd ((_ sign_extend 32) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse5) .cse6 .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (concat .cse7 .cse5))))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (or (= (let ((.cse16 (let ((.cse26 (store .cse27 .cse28 .cse29))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26))) (let ((.cse24 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (bvadd ((_ sign_extend 32) (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse24 .cse6) (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse23 ((_ extract 31 0) .cse25)) (.cse22 ((_ extract 63 32) .cse25))) (let ((.cse20 (store (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23) .cse6 .cse22))) (let ((.cse21 (bvadd (concat .cse22 .cse23) ((_ sign_extend 32) (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))) (let ((.cse18 ((_ extract 31 0) .cse21)) (.cse17 ((_ extract 63 32) .cse21))) (bvadd (concat .cse17 .cse18) ((_ sign_extend 32) (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse18) .cse6 .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))))))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse1) .cse30 .cse31 .cse32) (or .cse30 .cse33 (= .cse1 (let ((.cse34 (let ((.cse44 (store .cse45 .cse28 .cse29))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44))) (let ((.cse42 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (bvadd ((_ sign_extend 32) (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse42 .cse6) (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse41 ((_ extract 31 0) .cse43)) (.cse40 ((_ extract 63 32) .cse43))) (let ((.cse38 (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse41) .cse6 .cse40))) (let ((.cse39 (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse40 .cse41)))) (let ((.cse36 ((_ extract 31 0) .cse39)) (.cse35 ((_ extract 63 32) .cse39))) (bvadd (concat .cse35 .cse36) ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse36) .cse6 .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))))))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34)))) .cse31 .cse32) (or .cse33 .cse46 .cse47 .cse32) (bvule c_~N~0 (_ bv536870911 32)) (or (= .cse1 (let ((.cse48 (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse56 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (bvadd (concat (select .cse56 .cse6) (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse55 ((_ extract 31 0) .cse57)) (.cse54 ((_ extract 63 32) .cse57))) (let ((.cse52 (store (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse55) .cse6 .cse54))) (let ((.cse53 (bvadd ((_ sign_extend 32) (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse54 .cse55)))) (let ((.cse50 ((_ extract 31 0) .cse53)) (.cse49 ((_ extract 63 32) .cse53))) (bvadd (concat .cse49 .cse50) ((_ sign_extend 32) (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse50) .cse6 .cse49)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48)))) .cse46 .cse32) (or .cse0 .cse46 .cse47 .cse32)))))))) is different from false [2022-11-18 18:36:23,183 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse75 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse74 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse75)) (.cse70 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse71 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse75))) (let ((.cse58 (select .cse70 .cse71)) (.cse69 (select .cse70 .cse74))) (let ((.cse28 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse75)) (.cse15 (store .cse70 .cse74 (bvadd .cse69 (_ bv5 32)))) (.cse72 (bvadd .cse58 (_ bv5 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse45 (store .cse15 .cse71 .cse72)) (.cse1 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse73 (select .cse70 .cse28))) (let ((.cse30 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse29 (bvadd .cse73 (_ bv5 32))) (.cse31 (not (= .cse73 (_ bv1 32)))) (.cse33 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse27 (store .cse70 .cse71 .cse72)) (.cse0 (not (= .cse69 (_ bv1 32)))) (.cse46 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse47 (= (let ((.cse59 (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse67 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (bvadd (concat (select .cse67 .cse6) (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse66 ((_ extract 31 0) .cse68)) (.cse65 ((_ extract 63 32) .cse68))) (let ((.cse63 (store (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse66) .cse6 .cse65))) (let ((.cse64 (bvadd ((_ sign_extend 32) (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse63) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse65 .cse66)))) (let ((.cse61 ((_ extract 31 0) .cse64)) (.cse60 ((_ extract 63 32) .cse64))) (bvadd (concat .cse60 .cse61) ((_ sign_extend 32) (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse61) .cse6 .cse60)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse1)) (.cse32 (not (= .cse58 (_ bv1 32))))) (and (or .cse0 (= .cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse13 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (bvadd ((_ sign_extend 32) (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse13 .cse6) (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse12 ((_ extract 31 0) .cse14)) (.cse11 ((_ extract 63 32) .cse14))) (let ((.cse4 (store (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12) .cse6 .cse11))) (let ((.cse9 (bvadd ((_ sign_extend 32) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse11 .cse12)))) (let ((.cse7 ((_ extract 63 32) .cse9)) (.cse5 ((_ extract 31 0) .cse9))) (bvadd ((_ sign_extend 32) (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse5) .cse6 .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (concat .cse7 .cse5))))))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (or (= (let ((.cse16 (let ((.cse26 (store .cse27 .cse28 .cse29))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26))) (let ((.cse24 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (bvadd ((_ sign_extend 32) (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse24 .cse6) (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse23 ((_ extract 31 0) .cse25)) (.cse22 ((_ extract 63 32) .cse25))) (let ((.cse20 (store (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23) .cse6 .cse22))) (let ((.cse21 (bvadd (concat .cse22 .cse23) ((_ sign_extend 32) (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))) (let ((.cse18 ((_ extract 31 0) .cse21)) (.cse17 ((_ extract 63 32) .cse21))) (bvadd (concat .cse17 .cse18) ((_ sign_extend 32) (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse18) .cse6 .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))))))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse1) .cse30 .cse31 .cse32) (or .cse30 .cse33 (= .cse1 (let ((.cse34 (let ((.cse44 (store .cse45 .cse28 .cse29))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44))) (let ((.cse42 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (bvadd ((_ sign_extend 32) (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse42 .cse6) (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse41 ((_ extract 31 0) .cse43)) (.cse40 ((_ extract 63 32) .cse43))) (let ((.cse38 (store (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse41) .cse6 .cse40))) (let ((.cse39 (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse40 .cse41)))) (let ((.cse36 ((_ extract 31 0) .cse39)) (.cse35 ((_ extract 63 32) .cse39))) (bvadd (concat .cse35 .cse36) ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse36) .cse6 .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))))))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34)))) .cse31 .cse32) (or .cse33 .cse46 .cse47 .cse32) (bvule c_~N~0 (_ bv536870911 32)) (or (= .cse1 (let ((.cse48 (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse56 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (bvadd (concat (select .cse56 .cse6) (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse55 ((_ extract 31 0) .cse57)) (.cse54 ((_ extract 63 32) .cse57))) (let ((.cse52 (store (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse55) .cse6 .cse54))) (let ((.cse53 (bvadd ((_ sign_extend 32) (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (concat .cse54 .cse55)))) (let ((.cse50 ((_ extract 31 0) .cse53)) (.cse49 ((_ extract 63 32) .cse53))) (bvadd (concat .cse49 .cse50) ((_ sign_extend 32) (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse50) .cse6 .cse49)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48)))) .cse46 .cse32) (or .cse0 .cse46 .cse47 .cse32)))))))) is different from true [2022-11-18 18:36:56,109 WARN L233 SmtUtils]: Spent 11.83s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:37:03,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:37:05,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:37:07,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:37:10,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:37:28,045 WARN L233 SmtUtils]: Spent 9.31s on a formula simplification. DAG size of input: 120 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:37:32,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:37:37,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:37:40,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:37:58,153 WARN L233 SmtUtils]: Spent 15.50s on a formula simplification. DAG size of input: 103 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:38:00,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 18:38:03,072 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse70 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse65 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse66 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse70))) (let ((.cse54 (select .cse65 .cse66)) (.cse69 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse70))) (let ((.cse22 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse70)) (.cse53 (select .cse65 .cse69)) (.cse67 (bvadd .cse54 (_ bv5 32)))) (let ((.cse13 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse40 (store (store .cse65 .cse69 (bvadd .cse53 (_ bv5 32))) .cse66 .cse67)) (.cse24 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse68 (select .cse65 .cse22))) (let ((.cse25 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse23 (bvadd .cse68 (_ bv5 32))) (.cse26 (not (= .cse68 (_ bv1 32)))) (.cse28 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse21 (store .cse65 .cse66 .cse67)) (.cse41 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse42 (= (let ((.cse55 (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (bvadd (concat (select .cse63 .cse4) (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse62 ((_ extract 31 0) .cse64)) (.cse61 ((_ extract 63 32) .cse64))) (let ((.cse59 (store (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse62) .cse4 .cse61))) (let ((.cse60 (bvadd ((_ sign_extend 32) (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)) (concat .cse61 .cse62)))) (let ((.cse57 ((_ extract 31 0) .cse60)) (.cse56 ((_ extract 63 32) .cse60))) (bvadd (concat .cse56 .cse57) ((_ sign_extend 32) (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse57) .cse4 .cse56)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse24)) (.cse27 (not (= .cse54 (_ bv1 32))))) (and (not (bvslt (_ bv3 32) c_~N~0)) (exists ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1.base| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select .cse0 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (let ((.cse5 ((_ sign_extend 32) (_ bv6 32)))) (bvadd .cse5 (let ((.cse6 (bvadd (let ((.cse7 (bvadd .cse5 (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64)))))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) ((_ sign_extend 32) .cse3)))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6)))))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (_ bv6 32) (select .cse0 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) ((_ extract 31 0) .cse2)) (= (_ bv6 32) (select .cse0 |ULTIMATE.start_main_~a~0#1.offset|)) (= (_ bv6 32) .cse3) (= ((_ extract 63 32) .cse2) (select .cse1 .cse4))))))) (or (= (let ((.cse8 (let ((.cse20 (store .cse21 .cse22 .cse23))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20))) (let ((.cse18 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (bvadd ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse18 .cse4) (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse16 ((_ extract 31 0) .cse19)) (.cse15 ((_ extract 63 32) .cse19))) (let ((.cse12 (store (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse16) .cse4 .cse15))) (let ((.cse14 (bvadd (concat .cse15 .cse16) ((_ sign_extend 32) (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))))) (let ((.cse10 ((_ extract 31 0) .cse14)) (.cse9 ((_ extract 63 32) .cse14))) (bvadd (concat .cse9 .cse10) ((_ sign_extend 32) (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse10) .cse4 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))))))))))))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse24) .cse25 .cse26 .cse27) (bvslt (_ bv2 32) c_~N~0) (or .cse25 .cse28 (= .cse24 (let ((.cse29 (let ((.cse39 (store .cse40 .cse22 .cse23))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39))) (let ((.cse37 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (bvadd ((_ sign_extend 32) (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse37 .cse4) (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse36 ((_ extract 31 0) .cse38)) (.cse35 ((_ extract 63 32) .cse38))) (let ((.cse33 (store (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse36) .cse4 .cse35))) (let ((.cse34 (bvadd ((_ sign_extend 32) (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)) (concat .cse35 .cse36)))) (let ((.cse31 ((_ extract 31 0) .cse34)) (.cse30 ((_ extract 63 32) .cse34))) (bvadd (concat .cse30 .cse31) ((_ sign_extend 32) (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse4 .cse30)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))))))))))))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29)))) .cse26 .cse27) (or .cse28 .cse41 .cse42 .cse27) (or (= .cse24 (let ((.cse43 (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (let ((.cse51 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (bvadd (concat (select .cse51 .cse4) (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse50 ((_ extract 31 0) .cse52)) (.cse49 ((_ extract 63 32) .cse52))) (let ((.cse47 (store (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse50) .cse4 .cse49))) (let ((.cse48 (bvadd ((_ sign_extend 32) (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)) (concat .cse49 .cse50)))) (let ((.cse45 ((_ extract 31 0) .cse48)) (.cse44 ((_ extract 63 32) .cse48))) (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse4 .cse44)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43)))) .cse41 .cse27) (or (not (= .cse53 (_ bv1 32))) .cse41 .cse42 .cse27)))))))) is different from false [2022-11-18 18:38:05,088 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse70 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse65 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse66 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse70))) (let ((.cse54 (select .cse65 .cse66)) (.cse69 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse70))) (let ((.cse22 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse70)) (.cse53 (select .cse65 .cse69)) (.cse67 (bvadd .cse54 (_ bv5 32)))) (let ((.cse13 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse40 (store (store .cse65 .cse69 (bvadd .cse53 (_ bv5 32))) .cse66 .cse67)) (.cse24 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv6 32)))) (.cse68 (select .cse65 .cse22))) (let ((.cse25 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse23 (bvadd .cse68 (_ bv5 32))) (.cse26 (not (= .cse68 (_ bv1 32)))) (.cse28 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse21 (store .cse65 .cse66 .cse67)) (.cse41 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse42 (= (let ((.cse55 (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (bvadd (concat (select .cse63 .cse4) (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse62 ((_ extract 31 0) .cse64)) (.cse61 ((_ extract 63 32) .cse64))) (let ((.cse59 (store (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse62) .cse4 .cse61))) (let ((.cse60 (bvadd ((_ sign_extend 32) (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)) (concat .cse61 .cse62)))) (let ((.cse57 ((_ extract 31 0) .cse60)) (.cse56 ((_ extract 63 32) .cse60))) (bvadd (concat .cse56 .cse57) ((_ sign_extend 32) (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse57) .cse4 .cse56)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse24)) (.cse27 (not (= .cse54 (_ bv1 32))))) (and (not (bvslt (_ bv3 32) c_~N~0)) (exists ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1.base| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select .cse0 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (let ((.cse5 ((_ sign_extend 32) (_ bv6 32)))) (bvadd .cse5 (let ((.cse6 (bvadd (let ((.cse7 (bvadd .cse5 (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64)))))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) ((_ sign_extend 32) .cse3)))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6)))))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (_ bv6 32) (select .cse0 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) ((_ extract 31 0) .cse2)) (= (_ bv6 32) (select .cse0 |ULTIMATE.start_main_~a~0#1.offset|)) (= (_ bv6 32) .cse3) (= ((_ extract 63 32) .cse2) (select .cse1 .cse4))))))) (or (= (let ((.cse8 (let ((.cse20 (store .cse21 .cse22 .cse23))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20))) (let ((.cse18 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (bvadd ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse18 .cse4) (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse16 ((_ extract 31 0) .cse19)) (.cse15 ((_ extract 63 32) .cse19))) (let ((.cse12 (store (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse16) .cse4 .cse15))) (let ((.cse14 (bvadd (concat .cse15 .cse16) ((_ sign_extend 32) (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))))) (let ((.cse10 ((_ extract 31 0) .cse14)) (.cse9 ((_ extract 63 32) .cse14))) (bvadd (concat .cse9 .cse10) ((_ sign_extend 32) (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse10) .cse4 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))))))))))))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse24) .cse25 .cse26 .cse27) (bvslt (_ bv2 32) c_~N~0) (or .cse25 .cse28 (= .cse24 (let ((.cse29 (let ((.cse39 (store .cse40 .cse22 .cse23))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39))) (let ((.cse37 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (bvadd ((_ sign_extend 32) (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse37 .cse4) (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse36 ((_ extract 31 0) .cse38)) (.cse35 ((_ extract 63 32) .cse38))) (let ((.cse33 (store (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse36) .cse4 .cse35))) (let ((.cse34 (bvadd ((_ sign_extend 32) (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse33) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)) (concat .cse35 .cse36)))) (let ((.cse31 ((_ extract 31 0) .cse34)) (.cse30 ((_ extract 63 32) .cse34))) (bvadd (concat .cse30 .cse31) ((_ sign_extend 32) (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse4 .cse30)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))))))))))))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29)))) .cse26 .cse27) (or .cse28 .cse41 .cse42 .cse27) (or (= .cse24 (let ((.cse43 (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (let ((.cse51 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (bvadd (concat (select .cse51 .cse4) (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse50 ((_ extract 31 0) .cse52)) (.cse49 ((_ extract 63 32) .cse52))) (let ((.cse47 (store (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse50) .cse4 .cse49))) (let ((.cse48 (bvadd ((_ sign_extend 32) (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)) (concat .cse49 .cse50)))) (let ((.cse45 ((_ extract 31 0) .cse48)) (.cse44 ((_ extract 63 32) .cse48))) (bvadd (concat .cse44 .cse45) ((_ sign_extend 32) (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse45) .cse4 .cse44)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43)))) .cse41 .cse27) (or (not (= .cse53 (_ bv1 32))) .cse41 .cse42 .cse27)))))))) is different from true [2022-11-18 18:38:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:38:05,098 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-18 18:38:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 18:38:05,098 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 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-18 18:38:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:38:05,099 INFO L225 Difference]: With dead ends: 82 [2022-11-18 18:38:05,099 INFO L226 Difference]: Without dead ends: 68 [2022-11-18 18:38:05,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 274.7s TimeCoverageRelationStatistics Valid=459, Invalid=2937, Unknown=38, NotChecked=348, Total=3782 [2022-11-18 18:38:05,101 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 95 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 66 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 47.8s IncrementalHoareTripleChecker+Time [2022-11-18 18:38:05,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 92 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 665 Invalid, 6 Unknown, 213 Unchecked, 47.8s Time] [2022-11-18 18:38:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-18 18:38:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2022-11-18 18:38:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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-18 18:38:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-18 18:38:05,115 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 34 [2022-11-18 18:38:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:38:05,115 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-18 18:38:05,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 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-18 18:38:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-18 18:38:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 18:38:05,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:38:05,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:05,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-18 18:38:05,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:38:05,322 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:38:05,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-11-18 18:38:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:38:05,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089853495] [2022-11-18 18:38:05,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:38:05,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:38:05,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:38:05,324 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:38:05,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-18 18:38:05,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:38:05,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:38:05,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 18:38:05,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:38:05,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 18:38:05,802 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 18:38:05,802 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-18 18:38:05,964 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 18:38:05,965 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-18 18:38:06,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 18:38:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:38:06,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:38:06,458 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 16 treesize of output 14 [2022-11-18 18:38:06,466 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 20 treesize of output 16 [2022-11-18 18:38:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:38:06,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:38:06,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089853495] [2022-11-18 18:38:06,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089853495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:38:06,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:38:06,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-11-18 18:38:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988776129] [2022-11-18 18:38:06,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:38:06,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 18:38:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:38:06,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 18:38:06,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-18 18:38:06,722 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-18 18:38:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:38:08,169 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-11-18 18:38:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:38:08,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-18 18:38:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:38:08,171 INFO L225 Difference]: With dead ends: 85 [2022-11-18 18:38:08,171 INFO L226 Difference]: Without dead ends: 49 [2022-11-18 18:38:08,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-18 18:38:08,172 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:38:08,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 69 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 18:38:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-18 18:38:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-11-18 18:38:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-18 18:38:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-18 18:38:08,181 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 34 [2022-11-18 18:38:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:38:08,181 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-18 18:38:08,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-18 18:38:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-18 18:38:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 18:38:08,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:38:08,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:08,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-18 18:38:08,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:38:08,391 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:38:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 7 times [2022-11-18 18:38:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:38:08,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002792778] [2022-11-18 18:38:08,392 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 18:38:08,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:38:08,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:38:08,393 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:38:08,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-18 18:38:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:38:08,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 18:38:08,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:38:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:38:10,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:38:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 18:38:12,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:38:12,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002792778] [2022-11-18 18:38:12,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002792778] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:38:12,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 18:38:12,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2022-11-18 18:38:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196903591] [2022-11-18 18:38:12,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 18:38:12,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-18 18:38:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:38:12,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-18 18:38:12,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2022-11-18 18:38:12,739 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 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-18 18:38:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:38:18,078 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-11-18 18:38:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 18:38:18,079 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 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 36 [2022-11-18 18:38:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:38:18,080 INFO L225 Difference]: With dead ends: 104 [2022-11-18 18:38:18,080 INFO L226 Difference]: Without dead ends: 81 [2022-11-18 18:38:18,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=551, Invalid=1899, Unknown=0, NotChecked=0, Total=2450 [2022-11-18 18:38:18,081 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 270 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:38:18,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 37 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-18 18:38:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-18 18:38:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2022-11-18 18:38:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 70 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-18 18:38:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-18 18:38:18,107 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 36 [2022-11-18 18:38:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:38:18,108 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-18 18:38:18,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 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-18 18:38:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-18 18:38:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 18:38:18,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:38:18,113 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:38:18,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-18 18:38:18,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:38:18,327 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:38:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:38:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 8 times [2022-11-18 18:38:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:38:18,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451679455] [2022-11-18 18:38:18,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:38:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:38:18,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:38:18,330 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:38:18,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c237bc23-1029-4062-a415-9f10713a65cd/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-18 18:38:18,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:38:18,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:38:18,592 WARN L261 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-18 18:38:18,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:38:18,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:38:18,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-18 18:38:18,818 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-18 18:38:18,944 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 25 treesize of output 25 [2022-11-18 18:38:19,150 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 25 treesize of output 25 [2022-11-18 18:38:19,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 25 treesize of output 25 [2022-11-18 18:38:19,837 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 25 treesize of output 25 [2022-11-18 18:38:20,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:38:20,515 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-18 18:38:21,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:38:21,279 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 2 case distinctions, treesize of input 67 treesize of output 56 [2022-11-18 18:38:22,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:38:22,224 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 4 case distinctions, treesize of input 79 treesize of output 71 [2022-11-18 18:38:23,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:38:23,483 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 7 case distinctions, treesize of input 74 treesize of output 73 [2022-11-18 18:38:24,550 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-18 18:38:24,550 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 11 case distinctions, treesize of input 117 treesize of output 94 [2022-11-18 18:38:25,573 INFO L321 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-11-18 18:38:25,574 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 16 case distinctions, treesize of input 149 treesize of output 120 [2022-11-18 18:38:35,149 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 52 DAG size of output: 1 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-18 18:38:35,150 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-18 18:38:35,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 213 treesize of output 160 [2022-11-18 18:38:36,759 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-18 18:38:36,760 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 11 case distinctions, treesize of input 283 treesize of output 192 [2022-11-18 18:38:38,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:38:38,968 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 7 case distinctions, treesize of input 385 treesize of output 257 [2022-11-18 18:38:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:38:39,250 INFO L328 TraceCheckSpWp]: Computing backward predicates...