./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/eureka_05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa --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 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:05:36,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:05:36,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:05:36,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:05:36,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:05:36,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:05:36,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:05:36,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:05:36,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:05:36,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:05:36,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:05:36,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:05:36,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:05:36,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:05:36,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:05:36,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:05:36,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:05:36,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:05:36,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:05:36,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:05:36,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:05:36,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:05:36,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:05:36,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:05:36,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:05:36,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:05:36,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:05:36,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:05:36,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:05:36,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:05:36,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:05:36,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:05:36,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:05:36,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:05:36,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:05:36,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:05:36,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:05:36,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:05:36,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:05:36,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:05:36,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:05:36,957 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:05:36,986 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:05:36,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:05:36,987 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:05:36,987 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:05:36,988 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:05:36,988 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:05:36,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:05:36,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:05:36,989 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:05:36,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:05:36,989 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:05:36,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:05:36,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:05:36,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:05:36,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:05:36,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:05:36,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:05:36,990 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:05:36,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:05:36,991 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:05:36,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:05:36,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:05:36,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:05:36,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:05:36,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:05:36,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:05:36,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:05:36,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:05:36,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:05:36,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:05:36,997 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:05:36,997 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:05:36,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:05:36,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:05:36,998 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_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/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_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa 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 -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2021-12-06 19:05:37,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:05:37,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:05:37,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:05:37,203 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:05:37,204 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:05:37,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/loops/eureka_05.i [2021-12-06 19:05:37,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/data/489859c20/0f627c4f69144b6b97f5c07487d3a8bd/FLAGfdc12c787 [2021-12-06 19:05:37,619 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:05:37,620 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/sv-benchmarks/c/loops/eureka_05.i [2021-12-06 19:05:37,624 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/data/489859c20/0f627c4f69144b6b97f5c07487d3a8bd/FLAGfdc12c787 [2021-12-06 19:05:37,633 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/data/489859c20/0f627c4f69144b6b97f5c07487d3a8bd [2021-12-06 19:05:37,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:05:37,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:05:37,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:05:37,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:05:37,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:05:37,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af9c5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37, skipping insertion in model container [2021-12-06 19:05:37,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:05:37,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:05:37,764 WARN L230 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_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/sv-benchmarks/c/loops/eureka_05.i[810,823] [2021-12-06 19:05:37,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:05:37,781 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:05:37,790 WARN L230 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_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/sv-benchmarks/c/loops/eureka_05.i[810,823] [2021-12-06 19:05:37,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:05:37,806 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:05:37,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37 WrapperNode [2021-12-06 19:05:37,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:05:37,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:05:37,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:05:37,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:05:37,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,835 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2021-12-06 19:05:37,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:05:37,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:05:37,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:05:37,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:05:37,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:05:37,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:05:37,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:05:37,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:05:37,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (1/1) ... [2021-12-06 19:05:37,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:05:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:37,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:05:37,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:05:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:05:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:05:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 19:05:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 19:05:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:05:37,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:05:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 19:05:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 19:05:37,960 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:05:37,961 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:05:38,049 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:05:38,053 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:05:38,053 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-06 19:05:38,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:05:38 BoogieIcfgContainer [2021-12-06 19:05:38,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:05:38,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:05:38,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:05:38,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:05:38,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:05:37" (1/3) ... [2021-12-06 19:05:38,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:05:38, skipping insertion in model container [2021-12-06 19:05:38,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:05:37" (2/3) ... [2021-12-06 19:05:38,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:05:38, skipping insertion in model container [2021-12-06 19:05:38,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:05:38" (3/3) ... [2021-12-06 19:05:38,063 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2021-12-06 19:05:38,068 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:05:38,069 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 19:05:38,104 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:05:38,111 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:05:38,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 19:05:38,125 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) [2021-12-06 19:05:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 19:05:38,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:38,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:38,133 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2015864939, now seen corresponding path program 1 times [2021-12-06 19:05:38,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992265200] [2021-12-06 19:05:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:38,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:05:38,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:38,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992265200] [2021-12-06 19:05:38,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992265200] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:05:38,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:05:38,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 19:05:38,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599187173] [2021-12-06 19:05:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:05:38,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:05:38,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:38,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:05:38,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 19:05:38,324 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:38,353 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2021-12-06 19:05:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:05:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 19:05:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:38,361 INFO L225 Difference]: With dead ends: 42 [2021-12-06 19:05:38,361 INFO L226 Difference]: Without dead ends: 20 [2021-12-06 19:05:38,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 19:05:38,367 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:38,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:05:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-06 19:05:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-12-06 19:05:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-06 19:05:38,398 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2021-12-06 19:05:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:38,399 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-06 19:05:38,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-06 19:05:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 19:05:38,400 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:38,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:38,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:05:38,400 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1565230291, now seen corresponding path program 1 times [2021-12-06 19:05:38,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:38,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324593963] [2021-12-06 19:05:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:38,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:05:38,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:38,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324593963] [2021-12-06 19:05:38,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324593963] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:05:38,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973624643] [2021-12-06 19:05:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:38,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:38,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:38,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:05:38,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:05:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:38,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:05:38,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:05:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:05:38,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:05:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:05:38,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973624643] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:05:38,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:05:38,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-06 19:05:38,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805135029] [2021-12-06 19:05:38,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:05:38,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:05:38,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:05:38,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:05:38,587 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:38,616 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2021-12-06 19:05:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:05:38,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 19:05:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:38,617 INFO L225 Difference]: With dead ends: 45 [2021-12-06 19:05:38,617 INFO L226 Difference]: Without dead ends: 31 [2021-12-06 19:05:38,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:05:38,619 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:38,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:05:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-06 19:05:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2021-12-06 19:05:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-12-06 19:05:38,623 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2021-12-06 19:05:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:38,624 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-06 19:05:38,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-12-06 19:05:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-06 19:05:38,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:38,625 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:38,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:05:38,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:38,827 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash -7962739, now seen corresponding path program 2 times [2021-12-06 19:05:38,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:38,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301781596] [2021-12-06 19:05:38,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:38,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:05:38,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:38,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301781596] [2021-12-06 19:05:38,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301781596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:05:38,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:05:38,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 19:05:38,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480329762] [2021-12-06 19:05:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:05:38,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:05:38,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:05:38,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:05:38,987 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:39,012 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2021-12-06 19:05:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:05:39,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-06 19:05:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:39,013 INFO L225 Difference]: With dead ends: 38 [2021-12-06 19:05:39,013 INFO L226 Difference]: Without dead ends: 31 [2021-12-06 19:05:39,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:05:39,015 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:39,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 30 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:05:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-06 19:05:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2021-12-06 19:05:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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) [2021-12-06 19:05:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-06 19:05:39,022 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2021-12-06 19:05:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:39,022 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-06 19:05:39,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-06 19:05:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 19:05:39,023 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:39,024 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:39,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 19:05:39,024 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1148715813, now seen corresponding path program 1 times [2021-12-06 19:05:39,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:39,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859162700] [2021-12-06 19:05:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:39,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:05:39,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:39,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859162700] [2021-12-06 19:05:39,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859162700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:05:39,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:05:39,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:05:39,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579650513] [2021-12-06 19:05:39,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:05:39,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:05:39,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:05:39,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:05:39,089 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:39,118 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2021-12-06 19:05:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:05:39,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-06 19:05:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:39,119 INFO L225 Difference]: With dead ends: 47 [2021-12-06 19:05:39,120 INFO L226 Difference]: Without dead ends: 34 [2021-12-06 19:05:39,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:05:39,121 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:39,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:05:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-06 19:05:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2021-12-06 19:05:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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) [2021-12-06 19:05:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-06 19:05:39,125 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2021-12-06 19:05:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:39,125 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-06 19:05:39,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-06 19:05:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 19:05:39,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:39,126 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:39,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 19:05:39,127 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1025080129, now seen corresponding path program 1 times [2021-12-06 19:05:39,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:39,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911755026] [2021-12-06 19:05:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:39,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 19:05:39,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:39,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911755026] [2021-12-06 19:05:39,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911755026] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:05:39,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816380214] [2021-12-06 19:05:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:39,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:39,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:05:39,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:05:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:39,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:05:39,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:05:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:05:39,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:05:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:05:39,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816380214] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:05:39,310 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:05:39,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2021-12-06 19:05:39,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101101519] [2021-12-06 19:05:39,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:05:39,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 19:05:39,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:39,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 19:05:39,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:05:39,312 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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) [2021-12-06 19:05:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:39,403 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2021-12-06 19:05:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:05:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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 24 [2021-12-06 19:05:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:39,404 INFO L225 Difference]: With dead ends: 80 [2021-12-06 19:05:39,404 INFO L226 Difference]: Without dead ends: 64 [2021-12-06 19:05:39,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:05:39,405 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:39,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 109 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:05:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-06 19:05:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2021-12-06 19:05:39,410 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) [2021-12-06 19:05:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-12-06 19:05:39,411 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 24 [2021-12-06 19:05:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:39,411 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-06 19:05:39,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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) [2021-12-06 19:05:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-12-06 19:05:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 19:05:39,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:39,412 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:39,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:05:39,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:39,614 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2070168231, now seen corresponding path program 2 times [2021-12-06 19:05:39,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:39,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898090203] [2021-12-06 19:05:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:39,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 19:05:39,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:39,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898090203] [2021-12-06 19:05:39,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898090203] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:05:39,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854416180] [2021-12-06 19:05:39,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:05:39,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:39,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:05:39,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:05:39,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:05:39,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:05:39,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 19:05:39,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:05:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-06 19:05:39,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:05:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-06 19:05:39,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854416180] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:05:39,940 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:05:39,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2021-12-06 19:05:39,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9895935] [2021-12-06 19:05:39,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:05:39,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 19:05:39,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 19:05:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-12-06 19:05:39,942 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 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) [2021-12-06 19:05:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:40,065 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2021-12-06 19:05:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 19:05:40,066 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 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) Word has length 30 [2021-12-06 19:05:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:40,066 INFO L225 Difference]: With dead ends: 82 [2021-12-06 19:05:40,066 INFO L226 Difference]: Without dead ends: 66 [2021-12-06 19:05:40,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2021-12-06 19:05:40,068 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 170 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:40,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 76 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:05:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-06 19:05:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2021-12-06 19:05:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2021-12-06 19:05:40,076 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 30 [2021-12-06 19:05:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:40,076 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2021-12-06 19:05:40,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 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) [2021-12-06 19:05:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2021-12-06 19:05:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 19:05:40,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:40,078 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:40,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 19:05:40,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:40,280 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash 271285953, now seen corresponding path program 3 times [2021-12-06 19:05:40,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:40,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959177120] [2021-12-06 19:05:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:40,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-06 19:05:40,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:40,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959177120] [2021-12-06 19:05:40,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959177120] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:05:40,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347360793] [2021-12-06 19:05:40,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:05:40,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:40,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:40,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:05:40,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:05:40,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-06 19:05:40,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:05:40,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:05:40,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:05:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-12-06 19:05:40,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:05:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-12-06 19:05:40,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347360793] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:05:40,592 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:05:40,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2021-12-06 19:05:40,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598980727] [2021-12-06 19:05:40,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:05:40,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 19:05:40,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 19:05:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-06 19:05:40,593 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:40,715 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2021-12-06 19:05:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 19:05:40,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-06 19:05:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:40,717 INFO L225 Difference]: With dead ends: 79 [2021-12-06 19:05:40,717 INFO L226 Difference]: Without dead ends: 72 [2021-12-06 19:05:40,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2021-12-06 19:05:40,718 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 107 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:40,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 56 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:05:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-06 19:05:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-06 19:05:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2021-12-06 19:05:40,725 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 58 [2021-12-06 19:05:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:40,726 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2021-12-06 19:05:40,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2021-12-06 19:05:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 19:05:40,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:40,728 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:40,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 19:05:40,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-06 19:05:40,930 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1550484977, now seen corresponding path program 4 times [2021-12-06 19:05:40,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:40,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871102041] [2021-12-06 19:05:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:40,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 33 proven. 123 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-06 19:05:41,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:41,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871102041] [2021-12-06 19:05:41,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871102041] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:05:41,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133497592] [2021-12-06 19:05:41,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 19:05:41,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:41,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:41,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:05:41,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:05:41,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 19:05:41,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:05:41,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 19:05:41,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:05:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 130 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-06 19:05:41,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:05:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 48 proven. 130 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-06 19:05:41,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133497592] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:05:41,327 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:05:41,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 13 [2021-12-06 19:05:41,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002601565] [2021-12-06 19:05:41,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:05:41,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 19:05:41,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:41,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 19:05:41,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-06 19:05:41,333 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:41,539 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2021-12-06 19:05:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 19:05:41,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-06 19:05:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:41,541 INFO L225 Difference]: With dead ends: 137 [2021-12-06 19:05:41,541 INFO L226 Difference]: Without dead ends: 113 [2021-12-06 19:05:41,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=386, Invalid=804, Unknown=0, NotChecked=0, Total=1190 [2021-12-06 19:05:41,543 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 108 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:41,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 111 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:05:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-06 19:05:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2021-12-06 19:05:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2021-12-06 19:05:41,558 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 66 [2021-12-06 19:05:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:41,558 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2021-12-06 19:05:41,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2021-12-06 19:05:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:05:41,560 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:41,560 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:41,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 19:05:41,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:41,762 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 96032675, now seen corresponding path program 5 times [2021-12-06 19:05:41,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:41,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170632467] [2021-12-06 19:05:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:41,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-12-06 19:05:42,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170632467] [2021-12-06 19:05:42,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170632467] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:05:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917396828] [2021-12-06 19:05:42,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 19:05:42,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:42,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:42,091 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:05:42,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:05:42,188 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-12-06 19:05:42,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:05:42,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-06 19:05:42,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:05:42,460 INFO L354 Elim1Store]: treesize reduction 147, result has 14.0 percent of original size [2021-12-06 19:05:42,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 42 [2021-12-06 19:05:42,626 INFO L354 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2021-12-06 19:05:42,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 13 [2021-12-06 19:05:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 158 proven. 43 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 19:05:42,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:05:43,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 133 treesize of output 119 [2021-12-06 19:05:43,720 INFO L354 Elim1Store]: treesize reduction 140, result has 45.3 percent of original size [2021-12-06 19:05:43,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1557 treesize of output 1486 [2021-12-06 19:05:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 163 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-06 19:05:45,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917396828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:05:45,849 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:05:45,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 18] total 47 [2021-12-06 19:05:45,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156627248] [2021-12-06 19:05:45,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:05:45,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-06 19:05:45,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-06 19:05:45,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1991, Unknown=0, NotChecked=0, Total=2162 [2021-12-06 19:05:45,851 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:51,797 INFO L93 Difference]: Finished difference Result 559 states and 719 transitions. [2021-12-06 19:05:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-12-06 19:05:51,797 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 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 69 [2021-12-06 19:05:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:51,800 INFO L225 Difference]: With dead ends: 559 [2021-12-06 19:05:51,800 INFO L226 Difference]: Without dead ends: 490 [2021-12-06 19:05:51,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6011 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2178, Invalid=19578, Unknown=0, NotChecked=0, Total=21756 [2021-12-06 19:05:51,808 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 241 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:51,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 340 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1472 Invalid, 0 Unknown, 682 Unchecked, 0.7s Time] [2021-12-06 19:05:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-12-06 19:05:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 256. [2021-12-06 19:05:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 255 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2021-12-06 19:05:51,834 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 69 [2021-12-06 19:05:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:51,835 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2021-12-06 19:05:51,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2021-12-06 19:05:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 19:05:51,837 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:51,837 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:51,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 19:05:52,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:52,039 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1703731131, now seen corresponding path program 1 times [2021-12-06 19:05:52,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:52,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998326981] [2021-12-06 19:05:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:52,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 126 proven. 25 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-12-06 19:05:52,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:52,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998326981] [2021-12-06 19:05:52,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998326981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:05:52,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60990292] [2021-12-06 19:05:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:52,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:52,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:52,488 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:05:52,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:05:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:52,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-06 19:05:52,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:05:52,565 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:05:52,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:05:52,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-06 19:05:52,681 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-06 19:05:52,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-06 19:05:52,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:52,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:52,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:52,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:52,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-12-06 19:05:52,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:05:53,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)) is different from false [2021-12-06 19:05:53,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_305 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_305)) |c_~#array~0.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)) is different from false [2021-12-06 19:05:53,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_305 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_305)) |c_~#array~0.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)) (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_45| 1)))) is different from false [2021-12-06 19:05:53,206 INFO L354 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2021-12-06 19:05:53,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-06 19:05:53,211 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:05:53,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-06 19:05:53,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 19:05:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 221 trivial. 25 not checked. [2021-12-06 19:05:53,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60990292] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:05:53,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:05:53,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2021-12-06 19:05:53,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413587903] [2021-12-06 19:05:53,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:05:53,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-06 19:05:53,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:53,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-06 19:05:53,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1149, Unknown=3, NotChecked=210, Total=1482 [2021-12-06 19:05:53,327 INFO L87 Difference]: Start difference. First operand 256 states and 338 transitions. Second operand has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:55,566 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse2 (select |c_#memory_int| |c_~#array~0.base|))) (and (= (+ |c_ULTIMATE.start_main_~i~1#1| 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array~1#1.offset| 4))) (= 0 (select .cse2 (+ |c_~#array~0.offset| 4))) (= |c_ULTIMATE.start_main_~i~1#1| (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array~1#1.offset|))) (= 3 |c_~#array~0.base|) (= |c_ULTIMATE.start_main_~i~1#1| 1) (= (select |c_#valid| 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse2 (+ |c_~#array~0.offset| 8)) 0) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_305 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_305)) |c_~#array~0.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)) (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_45| 1)))) (not (= |c_ULTIMATE.start_main_~#array~1#1.base| |c_~#array~0.base|)))) is different from false [2021-12-06 19:05:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:05:56,844 INFO L93 Difference]: Finished difference Result 536 states and 709 transitions. [2021-12-06 19:05:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-06 19:05:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 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 73 [2021-12-06 19:05:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:05:56,847 INFO L225 Difference]: With dead ends: 536 [2021-12-06 19:05:56,847 INFO L226 Difference]: Without dead ends: 338 [2021-12-06 19:05:56,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=497, Invalid=3805, Unknown=4, NotChecked=524, Total=4830 [2021-12-06 19:05:56,849 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 139 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:05:56,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 453 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1035 Invalid, 0 Unknown, 206 Unchecked, 0.4s Time] [2021-12-06 19:05:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-12-06 19:05:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 254. [2021-12-06 19:05:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.308300395256917) internal successors, (331), 253 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 331 transitions. [2021-12-06 19:05:56,873 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 331 transitions. Word has length 73 [2021-12-06 19:05:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:05:56,873 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 331 transitions. [2021-12-06 19:05:56,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:05:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 331 transitions. [2021-12-06 19:05:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-06 19:05:56,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:05:56,874 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:05:56,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 19:05:57,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:57,076 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:05:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:05:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash -68174383, now seen corresponding path program 2 times [2021-12-06 19:05:57,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:05:57,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730073561] [2021-12-06 19:05:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:05:57,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:05:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:05:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 90 proven. 124 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:05:58,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:05:58,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730073561] [2021-12-06 19:05:58,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730073561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:05:58,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376217201] [2021-12-06 19:05:58,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:05:58,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:05:58,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:05:58,059 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:05:58,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 19:05:58,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:05:58,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:05:58,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-06 19:05:58,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:05:58,144 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:05:58,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:05:58,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-06 19:05:58,266 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-06 19:05:58,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-06 19:05:58,313 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-06 19:05:58,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-06 19:05:58,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:58,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:58,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:58,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:58,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:05:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-12-06 19:05:58,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:05:58,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)))) is different from false [2021-12-06 19:05:58,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 Int) (v_ArrVal_376 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_371)) |c_~#array~0.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)))) is different from false [2021-12-06 19:05:58,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_60| Int)) (or (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_60| 1)) (forall ((v_ArrVal_371 Int) (v_ArrVal_376 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_371)) |c_~#array~0.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)))))) is different from false [2021-12-06 19:05:58,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 Int) (|v_ULTIMATE.start_main_~i~1#1_60| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_369 Int)) (or (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_60| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_371)) |c_~#array~0.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)) 2))) is different from false [2021-12-06 19:05:58,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_61| Int)) (or (forall ((v_ArrVal_371 Int) (|v_ULTIMATE.start_main_~i~1#1_60| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_369 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_61| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_371)) |c_~#array~0.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)) 2) (< |v_ULTIMATE.start_main_~i~1#1_61| (+ |v_ULTIMATE.start_main_~i~1#1_60| 1)))) (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_61| 1)))) is different from false [2021-12-06 19:05:58,993 INFO L354 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2021-12-06 19:05:58,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 38 treesize of output 49 [2021-12-06 19:05:58,999 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:05:59,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-06 19:05:59,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 19:05:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 221 trivial. 30 not checked. [2021-12-06 19:05:59,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376217201] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:05:59,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:05:59,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 15] total 52 [2021-12-06 19:05:59,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813751262] [2021-12-06 19:05:59,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:05:59,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-06 19:05:59,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:05:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-06 19:05:59,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2095, Unknown=5, NotChecked=480, Total=2756 [2021-12-06 19:05:59,114 INFO L87 Difference]: Start difference. First operand 254 states and 331 transitions. Second operand has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 52 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:06:01,303 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (= (+ |c_ULTIMATE.start_main_~i~1#1| 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~i~1#1| (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array~1#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_61| Int)) (or (forall ((v_ArrVal_371 Int) (|v_ULTIMATE.start_main_~i~1#1_60| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_369 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_61| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_371)) |c_~#array~0.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)) 2) (< |v_ULTIMATE.start_main_~i~1#1_61| (+ |v_ULTIMATE.start_main_~i~1#1_60| 1)))) (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_61| 1)))) (<= 0 |c_~#array~0.offset|) (= 3 |c_~#array~0.base|) (= (select |c_#valid| 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (+ 2 |c_ULTIMATE.start_main_~i~1#1|) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array~1#1.offset| 8))) (= 2 |c_ULTIMATE.start_main_~i~1#1|) (<= |c_~#array~0.offset| 0))) is different from false [2021-12-06 19:06:08,980 WARN L227 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 42 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:06:10,982 WARN L838 $PredicateComparison]: unable to prove that (and (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8))) (<= 0 |c_~#array~0.offset|) (= 3 |c_~#array~0.base|) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (<= |c_ULTIMATE.start_main_~i~1#1| 1) (forall ((|v_ULTIMATE.start_main_~i~1#1_60| Int)) (or (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_60| 1)) (forall ((v_ArrVal_371 Int) (v_ArrVal_376 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_371)) |c_~#array~0.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8)))))) (<= |c_~#array~0.offset| 0)) is different from false [2021-12-06 19:06:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:06:13,455 INFO L93 Difference]: Finished difference Result 434 states and 569 transitions. [2021-12-06 19:06:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-06 19:06:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 52 states have internal predecessors, (127), 0 states have call successors, (0), 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 77 [2021-12-06 19:06:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:06:13,457 INFO L225 Difference]: With dead ends: 434 [2021-12-06 19:06:13,457 INFO L226 Difference]: Without dead ends: 303 [2021-12-06 19:06:13,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 134 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=511, Invalid=6991, Unknown=8, NotChecked=1232, Total=8742 [2021-12-06 19:06:13,460 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 102 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:06:13,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 548 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 517 Invalid, 0 Unknown, 349 Unchecked, 0.2s Time] [2021-12-06 19:06:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-06 19:06:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 287. [2021-12-06 19:06:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.2972027972027973) internal successors, (371), 286 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:06:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 371 transitions. [2021-12-06 19:06:13,482 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 371 transitions. Word has length 77 [2021-12-06 19:06:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:06:13,482 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 371 transitions. [2021-12-06 19:06:13,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 52 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:06:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 371 transitions. [2021-12-06 19:06:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-06 19:06:13,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:06:13,483 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:06:13,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 19:06:13,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 19:06:13,685 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:06:13,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:06:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash -470328087, now seen corresponding path program 3 times [2021-12-06 19:06:13,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:06:13,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057376684] [2021-12-06 19:06:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:06:13,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:06:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:06:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 55 proven. 169 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:06:14,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:06:14,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057376684] [2021-12-06 19:06:14,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057376684] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:06:14,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195175930] [2021-12-06 19:06:14,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:06:14,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:06:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:06:14,950 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:06:14,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 19:06:15,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-06 19:06:15,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:06:15,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-06 19:06:15,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:06:15,150 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:06:15,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:06:15,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-06 19:06:15,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-06 19:06:15,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-06 19:06:15,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-06 19:06:15,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-06 19:06:15,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 13 [2021-12-06 19:06:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2021-12-06 19:06:15,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:06:15,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_435) |c_~#array~0.base|))) (<= (select .cse0 |c_~#array~0.offset|) (select .cse0 (+ |c_~#array~0.offset| 4))))) is different from false [2021-12-06 19:06:15,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_ULTIMATE.start_main_~#array~1#1.base_12| Int)) (or (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#array~1#1.base_12| v_ArrVal_435) |c_~#array~0.base|))) (<= (select .cse0 |c_~#array~0.offset|) (select .cse0 (+ |c_~#array~0.offset| 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#array~1#1.base_12|) 0)))) is different from false [2021-12-06 19:06:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 9 not checked. [2021-12-06 19:06:15,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195175930] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:06:15,632 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:06:15,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 7] total 40 [2021-12-06 19:06:15,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784614537] [2021-12-06 19:06:15,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:06:15,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-06 19:06:15,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:06:15,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-06 19:06:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1357, Unknown=2, NotChecked=150, Total=1640 [2021-12-06 19:06:15,634 INFO L87 Difference]: Start difference. First operand 287 states and 371 transitions. Second operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:06:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:06:17,356 INFO L93 Difference]: Finished difference Result 603 states and 794 transitions. [2021-12-06 19:06:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 19:06:17,357 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-12-06 19:06:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:06:17,358 INFO L225 Difference]: With dead ends: 603 [2021-12-06 19:06:17,358 INFO L226 Difference]: Without dead ends: 339 [2021-12-06 19:06:17,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=470, Invalid=4092, Unknown=2, NotChecked=266, Total=4830 [2021-12-06 19:06:17,360 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 235 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:06:17,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 453 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1187 Invalid, 0 Unknown, 152 Unchecked, 0.6s Time] [2021-12-06 19:06:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-12-06 19:06:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 262. [2021-12-06 19:06:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:06:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2021-12-06 19:06:17,381 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 81 [2021-12-06 19:06:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:06:17,382 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2021-12-06 19:06:17,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:06:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2021-12-06 19:06:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-06 19:06:17,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:06:17,383 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:06:17,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 19:06:17,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:06:17,584 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:06:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:06:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1404849113, now seen corresponding path program 4 times [2021-12-06 19:06:17,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:06:17,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124772272] [2021-12-06 19:06:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:06:17,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:06:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:06:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 117 proven. 65 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-06 19:06:18,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:06:18,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124772272] [2021-12-06 19:06:18,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124772272] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:06:18,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941637770] [2021-12-06 19:06:18,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 19:06:18,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:06:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:06:18,116 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:06:18,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 19:06:18,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 19:06:18,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:06:18,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-06 19:06:18,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:06:18,411 INFO L354 Elim1Store]: treesize reduction 147, result has 14.0 percent of original size [2021-12-06 19:06:18,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 42 [2021-12-06 19:06:18,517 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-06 19:06:18,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-12-06 19:06:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 90 proven. 123 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-06 19:06:18,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:06:18,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 72 [2021-12-06 19:06:18,995 INFO L354 Elim1Store]: treesize reduction 81, result has 52.1 percent of original size [2021-12-06 19:06:18,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2070 treesize of output 1915 [2021-12-06 19:06:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 161 proven. 30 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 19:06:19,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941637770] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:06:19,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:06:19,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 14] total 47 [2021-12-06 19:06:19,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421722242] [2021-12-06 19:06:19,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:06:19,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-06 19:06:19,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:06:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-06 19:06:19,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1990, Unknown=0, NotChecked=0, Total=2162 [2021-12-06 19:06:19,495 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 47 states, 47 states have (on average 2.425531914893617) internal successors, (114), 47 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:06:53,025 WARN L227 SmtUtils]: Spent 32.17s on a formula simplification. DAG size of input: 48 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:07:19,505 WARN L227 SmtUtils]: Spent 26.29s on a formula simplification. DAG size of input: 60 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:07:54,874 WARN L227 SmtUtils]: Spent 32.19s on a formula simplification. DAG size of input: 51 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:07:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:07:55,451 INFO L93 Difference]: Finished difference Result 1026 states and 1355 transitions. [2021-12-06 19:07:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-12-06 19:07:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.425531914893617) internal successors, (114), 47 states have internal predecessors, (114), 0 states have call successors, (0), 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 81 [2021-12-06 19:07:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:07:55,455 INFO L225 Difference]: With dead ends: 1026 [2021-12-06 19:07:55,455 INFO L226 Difference]: Without dead ends: 829 [2021-12-06 19:07:55,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3919 ImplicationChecksByTransitivity, 95.6s TimeCoverageRelationStatistics Valid=893, Invalid=10879, Unknown=0, NotChecked=0, Total=11772 [2021-12-06 19:07:55,459 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 144 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:07:55,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 740 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1958 Invalid, 0 Unknown, 503 Unchecked, 1.0s Time] [2021-12-06 19:07:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2021-12-06 19:07:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 356. [2021-12-06 19:07:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.304225352112676) internal successors, (463), 355 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:07:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2021-12-06 19:07:55,494 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 81 [2021-12-06 19:07:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:07:55,494 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2021-12-06 19:07:55,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.425531914893617) internal successors, (114), 47 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:07:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2021-12-06 19:07:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-06 19:07:55,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:07:55,495 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:07:55,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 19:07:55,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:07:55,697 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:07:55,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:07:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1992724905, now seen corresponding path program 5 times [2021-12-06 19:07:55,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:07:55,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833643680] [2021-12-06 19:07:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:07:55,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:07:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:07:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 55 proven. 169 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 19:07:56,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:07:56,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833643680] [2021-12-06 19:07:56,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833643680] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:07:56,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783175570] [2021-12-06 19:07:56,580 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 19:07:56,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:07:56,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:07:56,581 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:07:56,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 19:07:56,704 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-12-06 19:07:56,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:07:56,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-06 19:07:56,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:07:56,796 INFO L354 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-12-06 19:07:56,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-06 19:07:56,943 INFO L354 Elim1Store]: treesize reduction 147, result has 14.0 percent of original size [2021-12-06 19:07:56,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 42 [2021-12-06 19:07:57,019 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-06 19:07:57,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 10 [2021-12-06 19:07:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 156 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-06 19:07:57,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:07:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 135 proven. 8 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-12-06 19:07:59,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783175570] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:07:59,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:07:59,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 11] total 46 [2021-12-06 19:07:59,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799564207] [2021-12-06 19:07:59,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:07:59,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-06 19:07:59,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:07:59,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-06 19:07:59,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1886, Unknown=0, NotChecked=0, Total=2070 [2021-12-06 19:07:59,142 INFO L87 Difference]: Start difference. First operand 356 states and 463 transitions. Second operand has 46 states, 46 states have (on average 2.391304347826087) internal successors, (110), 46 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:08:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:08:01,447 INFO L93 Difference]: Finished difference Result 824 states and 1104 transitions. [2021-12-06 19:08:01,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-12-06 19:08:01,447 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.391304347826087) internal successors, (110), 46 states have internal predecessors, (110), 0 states have call successors, (0), 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 81 [2021-12-06 19:08:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:08:01,450 INFO L225 Difference]: With dead ends: 824 [2021-12-06 19:08:01,450 INFO L226 Difference]: Without dead ends: 663 [2021-12-06 19:08:01,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=833, Invalid=9267, Unknown=0, NotChecked=0, Total=10100 [2021-12-06 19:08:01,451 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 213 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:08:01,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 463 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1155 Invalid, 0 Unknown, 482 Unchecked, 0.6s Time] [2021-12-06 19:08:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-12-06 19:08:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 378. [2021-12-06 19:08:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.3076923076923077) internal successors, (493), 377 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:08:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 493 transitions. [2021-12-06 19:08:01,490 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 493 transitions. Word has length 81 [2021-12-06 19:08:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:08:01,490 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 493 transitions. [2021-12-06 19:08:01,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.391304347826087) internal successors, (110), 46 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:08:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 493 transitions. [2021-12-06 19:08:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-06 19:08:01,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:08:01,491 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:08:01,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-06 19:08:01,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:08:01,692 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:08:01,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:08:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2054764519, now seen corresponding path program 6 times [2021-12-06 19:08:01,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:08:01,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602249218] [2021-12-06 19:08:01,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:08:01,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:08:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:08:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 108 proven. 97 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-06 19:08:02,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:08:02,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602249218] [2021-12-06 19:08:02,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602249218] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:08:02,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963380584] [2021-12-06 19:08:02,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-06 19:08:02,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:08:02,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:08:02,793 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:08:02,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 19:08:02,981 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-12-06 19:08:02,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:08:02,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-06 19:08:02,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:08:03,039 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-06 19:08:03,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:03,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-06 19:08:03,209 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-06 19:08:03,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-06 19:08:03,271 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-06 19:08:03,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2021-12-06 19:08:03,377 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-06 19:08:03,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2021-12-06 19:08:03,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:08:03,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:03,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:08:03,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:03,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:08:03,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:03,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:08:03,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:03,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 19:08:03,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-12-06 19:08:04,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:08:04,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_619 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) is different from false [2021-12-06 19:08:04,512 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_619 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) (<= 1 |c_ULTIMATE.start_main_~i~1#1|)) is different from false [2021-12-06 19:08:04,518 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3)) (<= 1 |c_ULTIMATE.start_main_~i~1#1|)) is different from false [2021-12-06 19:08:04,618 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int) (|ULTIMATE.start_main_~i~1#1| Int) (v_ArrVal_611 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~1#1_95| 1) |ULTIMATE.start_main_~i~1#1|) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_611) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) is different from false [2021-12-06 19:08:04,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 Int) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int) (|v_ULTIMATE.start_main_~i~1#1_97| Int) (v_ArrVal_611 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~1#1_95| 1) |v_ULTIMATE.start_main_~i~1#1_97|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_609) (+ (* |v_ULTIMATE.start_main_~i~1#1_97| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_611) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)) 3) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) is different from false [2021-12-06 19:08:04,729 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_98| Int)) (or (forall ((v_ArrVal_609 Int) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int) (|v_ULTIMATE.start_main_~i~1#1_97| Int) (v_ArrVal_611 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~1#1_95| 1) |v_ULTIMATE.start_main_~i~1#1_97|) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_98| 4)) v_ArrVal_609) (+ (* |v_ULTIMATE.start_main_~i~1#1_97| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_611) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_98| 1)))) is different from false [2021-12-06 19:08:04,787 INFO L354 Elim1Store]: treesize reduction 224, result has 29.1 percent of original size [2021-12-06 19:08:04,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 45 treesize of output 104 [2021-12-06 19:08:04,816 INFO L354 Elim1Store]: treesize reduction 46, result has 49.5 percent of original size [2021-12-06 19:08:04,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 119 [2021-12-06 19:08:04,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 19:08:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 221 trivial. 30 not checked. [2021-12-06 19:08:04,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963380584] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:08:04,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:08:04,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 18] total 54 [2021-12-06 19:08:04,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776034113] [2021-12-06 19:08:04,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:08:04,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-06 19:08:04,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:08:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-06 19:08:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2158, Unknown=15, NotChecked=594, Total=2970 [2021-12-06 19:08:04,999 INFO L87 Difference]: Start difference. First operand 378 states and 493 transitions. Second operand has 55 states, 55 states have (on average 2.4) internal successors, (132), 54 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:08:07,267 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse2 (select |c_#memory_int| |c_~#array~0.base|))) (and (= (+ |c_ULTIMATE.start_main_~i~1#1| 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array~1#1.offset| 4))) (= 0 (select .cse2 (+ |c_~#array~0.offset| 4))) (= |c_ULTIMATE.start_main_~i~1#1| (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array~1#1.offset|))) (<= 0 |c_~#array~0.offset|) (= 3 |c_~#array~0.base|) (= 3 |c_ULTIMATE.start_main_~i~1#1|) (= (select |c_#valid| 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (< 1 |c_ULTIMATE.start_main_~#array~1#1.base|) (= (select .cse2 (+ |c_~#array~0.offset| 8)) 0) (<= |c_~#array~0.base| 3) (or (forall ((v_ArrVal_619 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) (<= 1 |c_ULTIMATE.start_main_~i~1#1|)) (= (select |c_#valid| 2) 1) (not (= 2 |c_ULTIMATE.start_main_~#array~1#1.base|)) (<= |c_~#array~0.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~1#1_98| Int)) (or (forall ((v_ArrVal_609 Int) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int) (|v_ULTIMATE.start_main_~i~1#1_97| Int) (v_ArrVal_611 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~1#1_95| 1) |v_ULTIMATE.start_main_~i~1#1_97|) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_98| 4)) v_ArrVal_609) (+ (* |v_ULTIMATE.start_main_~i~1#1_97| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_611) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) (< |c_ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_98| 1)))) (< 0 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#array~1#1.base| |c_~#array~0.base|)))) is different from false [2021-12-06 19:08:36,485 WARN L227 SmtUtils]: Spent 29.15s on a formula simplification. DAG size of input: 70 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 19:08:37,166 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|))) (and (= 0 (select .cse0 (+ |c_~#array~0.offset| 4))) (<= 0 |c_~#array~0.offset|) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (< 1 |c_ULTIMATE.start_main_~#array~1#1.base|) (= (select .cse0 (+ |c_~#array~0.offset| 8)) 0) (<= |c_~#array~0.base| 3) (or (forall ((v_ArrVal_619 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12)))) (<= 1 |c_ULTIMATE.start_main_~i~1#1|)) (forall ((|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int) (|ULTIMATE.start_main_~i~1#1| Int) (v_ArrVal_611 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~1#1_95| 1) |ULTIMATE.start_main_~i~1#1|) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_611) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (not (= 2 |c_ULTIMATE.start_main_~#array~1#1.base|)) (<= |c_~#array~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#array~1#1.base| |c_~#array~0.base|)))) is different from false [2021-12-06 19:08:37,846 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|))) (and (= 0 (select .cse0 (+ |c_~#array~0.offset| 4))) (<= 0 |c_~#array~0.offset|) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (< 1 |c_ULTIMATE.start_main_~#array~1#1.base|) (= (select .cse0 (+ |c_~#array~0.offset| 8)) 0) (<= |c_~#array~0.base| 3) (forall ((|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int) (|ULTIMATE.start_main_~i~1#1| Int) (v_ArrVal_611 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~1#1_95| 1) |ULTIMATE.start_main_~i~1#1|) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_611) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |c_~#array~0.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 12))) (not (= 2 |c_ULTIMATE.start_main_~#array~1#1.base|)) (<= |c_~#array~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#array~1#1.base| |c_~#array~0.base|)))) is different from false [2021-12-06 19:08:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:08:47,535 INFO L93 Difference]: Finished difference Result 1401 states and 1847 transitions. [2021-12-06 19:08:47,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-12-06 19:08:47,536 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.4) internal successors, (132), 54 states have internal predecessors, (132), 0 states have call successors, (0), 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 81 [2021-12-06 19:08:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:08:47,541 INFO L225 Difference]: With dead ends: 1401 [2021-12-06 19:08:47,541 INFO L226 Difference]: Without dead ends: 1215 [2021-12-06 19:08:47,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 140 SyntacticMatches, 13 SemanticMatches, 127 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 4289 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=1251, Invalid=13045, Unknown=20, NotChecked=2196, Total=16512 [2021-12-06 19:08:47,543 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 485 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 939 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 19:08:47,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 683 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1567 Invalid, 0 Unknown, 939 Unchecked, 0.9s Time] [2021-12-06 19:08:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2021-12-06 19:08:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 735. [2021-12-06 19:08:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 1.3106267029972751) internal successors, (962), 734 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:08:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 962 transitions. [2021-12-06 19:08:47,635 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 962 transitions. Word has length 81 [2021-12-06 19:08:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:08:47,635 INFO L470 AbstractCegarLoop]: Abstraction has 735 states and 962 transitions. [2021-12-06 19:08:47,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.4) internal successors, (132), 54 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:08:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 962 transitions. [2021-12-06 19:08:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-06 19:08:47,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:08:47,637 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:08:47,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 19:08:47,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 19:08:47,838 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:08:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:08:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1626752443, now seen corresponding path program 7 times [2021-12-06 19:08:47,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:08:47,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513062728] [2021-12-06 19:08:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:08:47,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:08:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:08:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 94 proven. 24 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-12-06 19:08:48,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:08:48,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513062728] [2021-12-06 19:08:48,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513062728] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:08:48,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307515636] [2021-12-06 19:08:48,305 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-06 19:08:48,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:08:48,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:08:48,306 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:08:48,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 19:08:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:08:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-06 19:08:48,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:08:48,403 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 19:08:48,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 19:08:48,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-06 19:08:48,467 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-06 19:08:48,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-06 19:08:48,503 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-06 19:08:48,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-06 19:08:48,542 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-06 19:08:48,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-06 19:08:48,582 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-06 19:08:48,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-06 19:08:48,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:48,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:48,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:48,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:48,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 19:08:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-12-06 19:08:49,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:08:49,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4)) is different from false [2021-12-06 19:08:49,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4)) is different from false [2021-12-06 19:08:49,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_115| Int)) (or (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int)) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)))))) is different from false [2021-12-06 19:08:49,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)))) is different from false [2021-12-06 19:08:49,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_116| Int)) (or (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_116|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_116| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |v_ULTIMATE.start_main_~i~1#1_116| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)))))) is different from false [2021-12-06 19:08:49,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_116| Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int) (v_ArrVal_678 Int)) (or (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_116|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_678) (+ (* |v_ULTIMATE.start_main_~i~1#1_116| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |v_ULTIMATE.start_main_~i~1#1_116| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)))) is different from false [2021-12-06 19:08:49,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_117| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_116| Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int) (v_ArrVal_678 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_117| (+ 1 |v_ULTIMATE.start_main_~i~1#1_116|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_117| 4)) v_ArrVal_678) (+ (* |v_ULTIMATE.start_main_~i~1#1_116| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |v_ULTIMATE.start_main_~i~1#1_116| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)))) (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_117|)))) is different from false [2021-12-06 19:08:49,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (|v_ULTIMATE.start_main_~i~1#1_117| Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_116| Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int) (v_ArrVal_678 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_117| (+ 1 |v_ULTIMATE.start_main_~i~1#1_116|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_676) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_117| 4)) v_ArrVal_678) (+ (* |v_ULTIMATE.start_main_~i~1#1_116| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |v_ULTIMATE.start_main_~i~1#1_116| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)) (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_117|)))) is different from false [2021-12-06 19:08:49,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_118| Int)) (or (forall ((v_ArrVal_676 Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (|v_ULTIMATE.start_main_~i~1#1_117| Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_116| Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int) (v_ArrVal_678 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_117| (+ 1 |v_ULTIMATE.start_main_~i~1#1_116|)) (< |v_ULTIMATE.start_main_~i~1#1_116| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_118| 4)) v_ArrVal_676) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_117| 4)) v_ArrVal_678) (+ (* |v_ULTIMATE.start_main_~i~1#1_116| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |v_ULTIMATE.start_main_~i~1#1_118| (+ 1 |v_ULTIMATE.start_main_~i~1#1_117|)))) (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_118|)))) is different from false [2021-12-06 19:08:49,618 INFO L354 Elim1Store]: treesize reduction 484, result has 11.2 percent of original size [2021-12-06 19:08:49,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 52 treesize of output 73 [2021-12-06 19:08:49,626 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 19:08:49,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-06 19:08:49,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 19:08:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 221 trivial. 34 not checked. [2021-12-06 19:08:49,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307515636] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:08:49,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:08:49,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 19] total 44 [2021-12-06 19:08:49,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031545678] [2021-12-06 19:08:49,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:08:49,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-06 19:08:49,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:08:49,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-06 19:08:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1144, Unknown=9, NotChecked=684, Total=1980 [2021-12-06 19:08:49,678 INFO L87 Difference]: Start difference. First operand 735 states and 962 transitions. Second operand has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 44 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:08:51,731 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|))) (and (= |c_ULTIMATE.start_main_~i~1#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|))) (= 3 |c_~#array~0.base|) (= (select |c_#valid| 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse0 |c_~#array~0.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~1#1_118| Int)) (or (forall ((v_ArrVal_676 Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (|v_ULTIMATE.start_main_~i~1#1_117| Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_116| Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int) (v_ArrVal_678 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_117| (+ 1 |v_ULTIMATE.start_main_~i~1#1_116|)) (< |v_ULTIMATE.start_main_~i~1#1_116| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_118| 4)) v_ArrVal_676) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_117| 4)) v_ArrVal_678) (+ (* |v_ULTIMATE.start_main_~i~1#1_116| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |v_ULTIMATE.start_main_~i~1#1_118| (+ 1 |v_ULTIMATE.start_main_~i~1#1_117|)))) (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_118|)))) (= |c_~#array~0.offset| 0) (= (select .cse0 (+ 16 |c_~#array~0.offset|)) 0) (= |c_ULTIMATE.start_main_~i~1#1| 4) (not (= |c_ULTIMATE.start_main_~#array~1#1.base| |c_~#array~0.base|)))) is different from false [2021-12-06 19:08:53,803 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse1 (select |c_#memory_int| |c_~#array~0.base|))) (and (= |c_ULTIMATE.start_main_~i~1#1| (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|))) (= 4 (select .cse0 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16))) (= 3 |c_~#array~0.base|) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse1 |c_~#array~0.offset|) 0) (= |c_~#array~0.offset| 0) (= (select .cse1 (+ 16 |c_~#array~0.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~1#1_117| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_116| Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int) (v_ArrVal_678 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_117| (+ 1 |v_ULTIMATE.start_main_~i~1#1_116|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_117| 4)) v_ArrVal_678) (+ (* |v_ULTIMATE.start_main_~i~1#1_116| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |v_ULTIMATE.start_main_~i~1#1_116| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)))) (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_117|)))) (<= |c_ULTIMATE.start_main_~i~1#1| 3) (not (= |c_ULTIMATE.start_main_~#array~1#1.base| |c_~#array~0.base|)))) is different from false [2021-12-06 19:08:55,875 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse1 (select |c_#memory_int| |c_~#array~0.base|))) (and (= |c_ULTIMATE.start_main_~i~1#1| (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_116| Int)) (or (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_116|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~i~1#1_115| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_116| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_681) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)) 4) (< |v_ULTIMATE.start_main_~i~1#1_116| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)))))) (= 4 (select .cse0 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16))) (<= |c_ULTIMATE.start_main_~i~1#1| 2) (= 3 |c_~#array~0.base|) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse1 |c_~#array~0.offset|) 0) (= |c_~#array~0.offset| 0) (= (select .cse1 (+ 16 |c_~#array~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#array~1#1.base| |c_~#array~0.base|)))) is different from false [2021-12-06 19:08:59,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|)) (.cse1 (select |c_#memory_int| |c_~#array~0.base|))) (and (= |c_ULTIMATE.start_main_~i~1#1| (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~1#1| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|))) (= 4 (select .cse0 (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16))) (= 3 |c_~#array~0.base|) (not (= 3 |c_ULTIMATE.start_main_~#array~1#1.base|)) (= (select .cse1 |c_~#array~0.offset|) 0) (<= |c_ULTIMATE.start_main_~i~1#1| 1) (forall ((|v_ULTIMATE.start_main_~i~1#1_115| Int)) (or (< |c_ULTIMATE.start_main_~i~1#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_115|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int)) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_115| 4) |c_ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |c_~#array~0.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 16)))))) (= |c_~#array~0.offset| 0) (= (select .cse1 (+ 16 |c_~#array~0.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#array~1#1.base| |c_~#array~0.base|)))) is different from false [2021-12-06 19:09:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:09:01,180 INFO L93 Difference]: Finished difference Result 1336 states and 1752 transitions. [2021-12-06 19:09:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-06 19:09:01,180 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 44 states have internal predecessors, (123), 0 states have call successors, (0), 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 85 [2021-12-06 19:09:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:09:01,183 INFO L225 Difference]: With dead ends: 1336 [2021-12-06 19:09:01,183 INFO L226 Difference]: Without dead ends: 720 [2021-12-06 19:09:01,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 147 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=352, Invalid=2879, Unknown=13, NotChecked=1586, Total=4830 [2021-12-06 19:09:01,184 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 432 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:09:01,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 327 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 396 Invalid, 0 Unknown, 432 Unchecked, 0.2s Time] [2021-12-06 19:09:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2021-12-06 19:09:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 715. [2021-12-06 19:09:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.3011204481792717) internal successors, (929), 714 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:09:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 929 transitions. [2021-12-06 19:09:01,268 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 929 transitions. Word has length 85 [2021-12-06 19:09:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:09:01,268 INFO L470 AbstractCegarLoop]: Abstraction has 715 states and 929 transitions. [2021-12-06 19:09:01,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 44 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:09:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 929 transitions. [2021-12-06 19:09:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-06 19:09:01,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:09:01,270 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:09:01,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 19:09:01,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 19:09:01,471 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:09:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:09:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2092251363, now seen corresponding path program 8 times [2021-12-06 19:09:01,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:09:01,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116071352] [2021-12-06 19:09:01,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:09:01,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:09:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:09:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2021-12-06 19:09:01,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:09:01,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116071352] [2021-12-06 19:09:01,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116071352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:09:01,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:09:01,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 19:09:01,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304347115] [2021-12-06 19:09:01,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:09:01,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:09:01,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:09:01,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:09:01,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:09:01,551 INFO L87 Difference]: Start difference. First operand 715 states and 929 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:09:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:09:01,624 INFO L93 Difference]: Finished difference Result 1069 states and 1388 transitions. [2021-12-06 19:09:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:09:01,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-12-06 19:09:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:09:01,626 INFO L225 Difference]: With dead ends: 1069 [2021-12-06 19:09:01,626 INFO L226 Difference]: Without dead ends: 367 [2021-12-06 19:09:01,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:09:01,627 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 79 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:09:01,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 32 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:09:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-12-06 19:09:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2021-12-06 19:09:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.289617486338798) internal successors, (472), 366 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:09:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 472 transitions. [2021-12-06 19:09:01,669 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 472 transitions. Word has length 85 [2021-12-06 19:09:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:09:01,670 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 472 transitions. [2021-12-06 19:09:01,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:09:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 472 transitions. [2021-12-06 19:09:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-06 19:09:01,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:09:01,671 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:09:01,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 19:09:01,671 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:09:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:09:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1684549395, now seen corresponding path program 9 times [2021-12-06 19:09:01,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:09:01,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200717615] [2021-12-06 19:09:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:09:01,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:09:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:09:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 17 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-12-06 19:09:01,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:09:01,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200717615] [2021-12-06 19:09:01,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200717615] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:09:01,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776239680] [2021-12-06 19:09:01,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:09:01,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:09:01,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:09:01,724 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:09:01,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 19:09:01,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-06 19:09:01,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:09:01,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:09:01,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:09:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-12-06 19:09:01,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:09:01,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776239680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:09:01,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:09:01,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2021-12-06 19:09:01,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37237099] [2021-12-06 19:09:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:09:01,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:09:01,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:09:01,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:09:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:09:01,909 INFO L87 Difference]: Start difference. First operand 367 states and 472 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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) [2021-12-06 19:09:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:09:01,969 INFO L93 Difference]: Finished difference Result 370 states and 475 transitions. [2021-12-06 19:09:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 19:09:01,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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) Word has length 89 [2021-12-06 19:09:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:09:01,970 INFO L225 Difference]: With dead ends: 370 [2021-12-06 19:09:01,970 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 19:09:01,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:09:01,971 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:09:01,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:09:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 19:09:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 19:09:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 19:09:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 19:09:01,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2021-12-06 19:09:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:09:01,972 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 19:09:01,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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) [2021-12-06 19:09:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 19:09:01,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 19:09:01,974 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 19:09:01,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 19:09:02,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 19:09:02,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 19:09:38,199 WARN L227 SmtUtils]: Spent 36.01s on a formula simplification. DAG size of input: 160 DAG size of output: 158 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 19:10:20,717 WARN L227 SmtUtils]: Spent 42.50s on a formula simplification. DAG size of input: 1382 DAG size of output: 1356 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 19:11:31,108 WARN L227 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 151 DAG size of output: 149 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 19:11:58,408 WARN L227 SmtUtils]: Spent 26.01s on a formula simplification. DAG size of input: 151 DAG size of output: 139 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-06 19:12:19,520 WARN L227 SmtUtils]: Spent 21.10s on a formula simplification. DAG size of input: 1356 DAG size of output: 92 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-06 19:12:21,727 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2021-12-06 19:12:21,727 INFO L854 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|))) (let ((.cse0 (= 2 (select .cse15 (+ |ULTIMATE.start_main_~#array~1#1.offset| 8)))) (.cse1 (= 4 (select .cse15 (+ |ULTIMATE.start_main_~#array~1#1.offset| 16)))) (.cse2 (<= 0 |ULTIMATE.start_main_~i~1#1|)) (.cse3 (<= 0 |~#array~0.offset|)) (.cse4 (= 3 |~#array~0.base|)) (.cse5 (<= 5 ~n~0)) (.cse6 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (.cse7 (< |ULTIMATE.start_SelectionSort_~i~0#1| (+ ~n~0 1))) (.cse8 (= |ULTIMATE.start_main_~#array~1#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_main_~i~1#1| 4)) (.cse10 (<= |~#array~0.offset| 0)) (.cse11 (= (select .cse15 0) 0)) (.cse12 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse13 (not (= |ULTIMATE.start_main_~#array~1#1.base| |~#array~0.base|))) (.cse14 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1#1.offset| 4)) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 3 |ULTIMATE.start_main_~i~1#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= 4 |ULTIMATE.start_main_~i~1#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 3 (select .cse15 (+ |ULTIMATE.start_main_~#array~1#1.offset| 12))) .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-12-06 19:12:21,727 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L854 garLoopResultBuilder]: At program point L44-3(lines 44 45) the Hoare annotation is: (let ((.cse21 (select |#memory_int| |~#array~0.base|)) (.cse13 (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|))) (let ((.cse14 (* |ULTIMATE.start_main_~i~1#1| 4)) (.cse16 (= 2 (select .cse13 (+ |ULTIMATE.start_main_~#array~1#1.offset| 8)))) (.cse20 (= 3 (select .cse13 (+ |ULTIMATE.start_main_~#array~1#1.offset| 12)))) (.cse17 (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#array~1#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_683)) |~#array~0.base| v_ArrVal_688) |ULTIMATE.start_main_~#array~1#1.base|) (+ |ULTIMATE.start_main_~#array~1#1.offset| 16)) 4))) (.cse18 (= (select .cse13 (+ |ULTIMATE.start_main_~#array~1#1.offset| 4)) 1)) (.cse0 (= 0 (select .cse21 (+ |~#array~0.offset| 4)))) (.cse19 (= 4 (select .cse13 (+ |ULTIMATE.start_main_~#array~1#1.offset| 16)))) (.cse1 (= 3 |~#array~0.base|)) (.cse2 (= (select |#valid| 3) 1)) (.cse3 (<= 5 ~n~0)) (.cse4 (= (select .cse21 |~#array~0.offset|) 0)) (.cse5 (< 1 |ULTIMATE.start_main_~#array~1#1.base|)) (.cse6 (= (select .cse21 (+ |~#array~0.offset| 8)) 0)) (.cse7 (= |~#array~0.offset| 0)) (.cse8 (= (select .cse21 (+ 16 |~#array~0.offset|)) 0)) (.cse9 (= |ULTIMATE.start_main_~#array~1#1.offset| 0)) (.cse10 (= (select |#valid| 2) 1)) (.cse11 (not (= 2 |ULTIMATE.start_main_~#array~1#1.base|))) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~i~1#1| 4) .cse12 (not (= |ULTIMATE.start_main_~#array~1#1.base| |~#array~0.base|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ 2 |ULTIMATE.start_main_~i~1#1|) (select .cse13 (+ .cse14 |ULTIMATE.start_main_~#array~1#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~1#1|) .cse8 .cse9 (forall ((v_ArrVal_609 Int) (|v_ULTIMATE.start_main_~i~1#1_95| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int) (|v_ULTIMATE.start_main_~i~1#1_97| Int) (v_ArrVal_611 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~1#1_95| 1) |v_ULTIMATE.start_main_~i~1#1_97|) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#array~1#1.base| (store (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_609) (+ (* |v_ULTIMATE.start_main_~i~1#1_97| 4) |ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_611) (+ (* |v_ULTIMATE.start_main_~i~1#1_95| 4) |ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |~#array~0.base| v_ArrVal_619) |ULTIMATE.start_main_~#array~1#1.base|) (+ |ULTIMATE.start_main_~#array~1#1.offset| 12)) 3) (<= 1 |v_ULTIMATE.start_main_~i~1#1_95|))) .cse11) (let ((.cse15 (+ |ULTIMATE.start_main_~i~1#1| 1))) (and (= .cse15 (select .cse13 (+ .cse14 |ULTIMATE.start_main_~#array~1#1.offset| 4))) .cse0 .cse16 (<= .cse15 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (forall ((v_ArrVal_619 (Array Int Int)) (v_ArrVal_614 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#array~1#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_614)) |~#array~0.base| v_ArrVal_619) |ULTIMATE.start_main_~#array~1#1.base|) (+ |ULTIMATE.start_main_~#array~1#1.offset| 12)) 3)) .cse8 .cse9 .cse11 (= (select .cse13 0) 0) .cse17 .cse18)) (and .cse0 .cse19 (forall ((v_ArrVal_371 Int) (|v_ULTIMATE.start_main_~i~1#1_60| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_369 Int)) (or (< |ULTIMATE.start_main_~i~1#1| (+ |v_ULTIMATE.start_main_~i~1#1_60| 1)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#array~1#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~1#1_60| 4) |ULTIMATE.start_main_~#array~1#1.offset|) v_ArrVal_371)) |~#array~0.base| v_ArrVal_376) |ULTIMATE.start_main_~#array~1#1.base|) (+ |ULTIMATE.start_main_~#array~1#1.offset| 8)) 2))) .cse1 (= |ULTIMATE.start_main_~i~1#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse11) (and .cse0 .cse16 (<= 0 |ULTIMATE.start_main_~i~1#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~1#1| 0) .cse7 .cse8 .cse9 .cse20 .cse11 .cse17 .cse18) (and .cse0 .cse19 .cse1 (= 3 |ULTIMATE.start_main_~i~1#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point L44-4(lines 44 45) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 52) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L854 garLoopResultBuilder]: At program point L32-3(lines 32 33) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|))) (let ((.cse12 (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse0 (= 2 (select .cse15 (+ |ULTIMATE.start_main_~#array~1#1.offset| 8)))) (.cse1 (<= (+ |ULTIMATE.start_main_~i~1#1| 1) 0)) (.cse2 (= 4 (select .cse15 (+ |ULTIMATE.start_main_~#array~1#1.offset| 16)))) (.cse3 (forall ((v_ArrVal_619 (Array Int Int))) (= 3 (select (select (store |#memory_int| |~#array~0.base| v_ArrVal_619) |ULTIMATE.start_main_~#array~1#1.base|) (+ |ULTIMATE.start_main_~#array~1#1.offset| 12))))) (.cse4 (<= 0 |~#array~0.offset|)) (.cse5 (= 3 |~#array~0.base|)) (.cse6 (<= 5 ~n~0)) (.cse7 (< |ULTIMATE.start_SelectionSort_~i~0#1| (+ ~n~0 1))) (.cse8 (= |ULTIMATE.start_main_~#array~1#1.offset| 0)) (.cse9 (<= |~#array~0.offset| 0)) (.cse10 (= (select .cse15 0) 0)) (.cse11 (= (select .cse15 (+ |ULTIMATE.start_main_~#array~1#1.offset| 4)) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) |ULTIMATE.start_SelectionSort_~i~0#1|) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= .cse12 |ULTIMATE.start_SelectionSort_~i~0#1|) .cse4 (let ((.cse13 (* 4 |ULTIMATE.start_SelectionSort_~rh~0#1|))) (or (= .cse13 (* 4 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (= .cse13 (* 4 |ULTIMATE.start_SelectionSort_~i~0#1|)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= |ULTIMATE.start_SelectionSort_~i~0#1| .cse12) .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse14 (select |#memory_int| |~#array~0.base|))) (< (select .cse14 (+ (* |ULTIMATE.start_SelectionSort_~i~0#1| 4) (- 4) |~#array~0.offset|)) (select .cse14 (+ (* |ULTIMATE.start_SelectionSort_~lh~0#1| 4) |~#array~0.offset|)))) .cse8 (<= .cse12 ~n~0) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_SelectionSort_~i~0#1| (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 1)) .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_SelectionSort_~lh~0#1| |ULTIMATE.start_SelectionSort_~rh~0#1|) .cse9 .cse10 .cse11)))) [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point L32-4(lines 32 33) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2021-12-06 19:12:21,728 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: (let ((.cse16 (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|))) (let ((.cse0 (= |ULTIMATE.start_main_~i~1#1| (select .cse16 (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#array~1#1.offset|)))) (.cse1 (= 2 (select .cse16 (+ |ULTIMATE.start_main_~#array~1#1.offset| 8)))) (.cse14 (= 4 (select .cse16 (+ |ULTIMATE.start_main_~#array~1#1.offset| 16)))) (.cse2 (<= 0 |ULTIMATE.start_main_~i~1#1|)) (.cse3 (<= 0 |~#array~0.offset|)) (.cse4 (= 3 |~#array~0.base|)) (.cse5 (<= 5 ~n~0)) (.cse6 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (.cse7 (< |ULTIMATE.start_SelectionSort_~i~0#1| (+ ~n~0 1))) (.cse8 (= |ULTIMATE.start_main_~#array~1#1.offset| 0)) (.cse15 (= 3 (select .cse16 (+ |ULTIMATE.start_main_~#array~1#1.offset| 12)))) (.cse9 (<= |~#array~0.offset| 0)) (.cse10 (= (select .cse16 0) 0)) (.cse11 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse12 (not (= |ULTIMATE.start_main_~#array~1#1.base| |~#array~0.base|))) (.cse13 (= (select .cse16 (+ |ULTIMATE.start_main_~#array~1#1.offset| 4)) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~i~1#1| 4) .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 5 |ULTIMATE.start_main_~i~1#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 (= |ULTIMATE.start_main_~i~1#1| 0) .cse3 .cse4 .cse5 (not (= 3 |ULTIMATE.start_main_~#array~1#1.base|)) .cse7 .cse8 .cse15 .cse9 .cse11 .cse13) (and .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-12-06 19:12:21,729 INFO L858 garLoopResultBuilder]: For program point L49-4(lines 49 50) no Hoare annotation was computed. [2021-12-06 19:12:21,729 INFO L858 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2021-12-06 19:12:21,729 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 19:12:21,729 INFO L858 garLoopResultBuilder]: For program point L30-2(lines 30 37) no Hoare annotation was computed. [2021-12-06 19:12:21,729 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 37) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |ULTIMATE.start_main_~#array~1#1.base|)) (.cse0 (+ |ULTIMATE.start_main_~i~1#1| 1))) (let ((.cse3 (<= .cse0 0)) (.cse4 (= 3 |~#array~0.base|)) (.cse5 (<= 5 ~n~0)) (.cse6 (= |ULTIMATE.start_main_~#array~1#1.offset| 0)) (.cse7 (= (select .cse1 0) 0)) (.cse8 (= (select .cse1 (+ |ULTIMATE.start_main_~#array~1#1.offset| 4)) 1))) (or (let ((.cse2 (select |#memory_int| |~#array~0.base|))) (and (= .cse0 (select .cse1 (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#array~1#1.offset| 4))) (= 0 (select .cse2 (+ |~#array~0.offset| 4))) .cse3 (forall ((v_ArrVal_688 (Array Int Int))) (= (select (select (store |#memory_int| |~#array~0.base| v_ArrVal_688) |ULTIMATE.start_main_~#array~1#1.base|) (+ |ULTIMATE.start_main_~#array~1#1.offset| 16)) 4)) .cse4 (= (select |#valid| 3) 1) (forall ((v_ArrVal_376 (Array Int Int))) (= 2 (select (select (store |#memory_int| |~#array~0.base| v_ArrVal_376) |ULTIMATE.start_main_~#array~1#1.base|) (+ |ULTIMATE.start_main_~#array~1#1.offset| 8)))) .cse5 (= (select .cse2 |~#array~0.offset|) 0) (= (select .cse2 (+ |~#array~0.offset| 8)) 0) (= |~#array~0.offset| 0) (= (select .cse2 (+ 16 |~#array~0.offset|)) 0) .cse6 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0) (= 3 (select .cse1 (+ |ULTIMATE.start_main_~#array~1#1.offset| 12))) .cse7 .cse8)) (and (= 2 (select .cse1 (+ |ULTIMATE.start_main_~#array~1#1.offset| 8))) .cse3 (= 4 (select .cse1 (+ |ULTIMATE.start_main_~#array~1#1.offset| 16))) (forall ((v_ArrVal_619 (Array Int Int))) (= 3 (select (select (store |#memory_int| |~#array~0.base| v_ArrVal_619) |ULTIMATE.start_main_~#array~1#1.base|) (+ |ULTIMATE.start_main_~#array~1#1.offset| 12)))) (<= 0 |~#array~0.offset|) .cse4 .cse5 (< |ULTIMATE.start_SelectionSort_~i~0#1| (+ ~n~0 1)) .cse6 (<= |~#array~0.offset| 0) .cse7 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| |ULTIMATE.start_SelectionSort_~i~0#1|) .cse8)))) [2021-12-06 19:12:21,729 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 38) no Hoare annotation was computed. [2021-12-06 19:12:21,731 INFO L732 BasicCegarLoop]: Path program histogram: [9, 5, 2, 1, 1] [2021-12-06 19:12:21,732 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 19:12:21,738 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] [2021-12-06 19:12:21,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_609,QUANTIFIED] [2021-12-06 19:12:21,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_611,QUANTIFIED] [2021-12-06 19:12:21,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] [2021-12-06 19:12:21,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] [2021-12-06 19:12:21,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] [2021-12-06 19:12:21,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] [2021-12-06 19:12:21,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] [2021-12-06 19:12:21,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_369,QUANTIFIED] [2021-12-06 19:12:21,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_371,QUANTIFIED] [2021-12-06 19:12:21,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] [2021-12-06 19:12:21,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] [2021-12-06 19:12:21,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] [2021-12-06 19:12:21,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] [2021-12-06 19:12:21,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_609,QUANTIFIED] [2021-12-06 19:12:21,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_611,QUANTIFIED] [2021-12-06 19:12:21,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] [2021-12-06 19:12:21,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] [2021-12-06 19:12:21,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] [2021-12-06 19:12:21,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] [2021-12-06 19:12:21,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] [2021-12-06 19:12:21,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_369,QUANTIFIED] [2021-12-06 19:12:21,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_371,QUANTIFIED] [2021-12-06 19:12:21,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] [2021-12-06 19:12:21,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] [2021-12-06 19:12:21,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] [2021-12-06 19:12:21,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] [2021-12-06 19:12:21,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] [2021-12-06 19:12:21,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:12:21 BoogieIcfgContainer [2021-12-06 19:12:21,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 19:12:21,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 19:12:21,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 19:12:21,776 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 19:12:21,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:05:38" (3/4) ... [2021-12-06 19:12:21,779 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 19:12:21,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-06 19:12:21,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-06 19:12:21,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-06 19:12:21,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 19:12:21,816 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 19:12:21,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 19:12:21,817 INFO L158 Benchmark]: Toolchain (without parser) took 404180.73ms. Allocated memory was 75.5MB in the beginning and 704.6MB in the end (delta: 629.1MB). Free memory was 49.9MB in the beginning and 344.4MB in the end (delta: -294.6MB). Peak memory consumption was 334.2MB. Max. memory is 16.1GB. [2021-12-06 19:12:21,817 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:12:21,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.99ms. Allocated memory was 75.5MB in the beginning and 109.1MB in the end (delta: 33.6MB). Free memory was 49.7MB in the beginning and 81.4MB in the end (delta: -31.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-06 19:12:21,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.45ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 79.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:12:21,817 INFO L158 Benchmark]: Boogie Preprocessor took 18.84ms. Allocated memory is still 109.1MB. Free memory was 79.6MB in the beginning and 78.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:12:21,818 INFO L158 Benchmark]: RCFGBuilder took 199.03ms. Allocated memory is still 109.1MB. Free memory was 78.4MB in the beginning and 68.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 19:12:21,818 INFO L158 Benchmark]: TraceAbstraction took 403719.33ms. Allocated memory was 109.1MB in the beginning and 704.6MB in the end (delta: 595.6MB). Free memory was 67.9MB in the beginning and 349.7MB in the end (delta: -281.8MB). Peak memory consumption was 417.6MB. Max. memory is 16.1GB. [2021-12-06 19:12:21,818 INFO L158 Benchmark]: Witness Printer took 40.17ms. Allocated memory is still 704.6MB. Free memory was 349.7MB in the beginning and 344.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-06 19:12:21,819 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.13ms. Allocated memory is still 75.5MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.99ms. Allocated memory was 75.5MB in the beginning and 109.1MB in the end (delta: 33.6MB). Free memory was 49.7MB in the beginning and 81.4MB in the end (delta: -31.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.45ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 79.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.84ms. Allocated memory is still 109.1MB. Free memory was 79.6MB in the beginning and 78.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 199.03ms. Allocated memory is still 109.1MB. Free memory was 78.4MB in the beginning and 68.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 403719.33ms. Allocated memory was 109.1MB in the beginning and 704.6MB in the end (delta: 595.6MB). Free memory was 67.9MB in the beginning and 349.7MB in the end (delta: -281.8MB). Peak memory consumption was 417.6MB. Max. memory is 16.1GB. * Witness Printer took 40.17ms. Allocated memory is still 704.6MB. Free memory was 349.7MB in the beginning and 344.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_609,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_611,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_369,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_371,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_609,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_611,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_369,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_371,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 403.6s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 178.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 199.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2261 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2261 mSDsluCounter, 4627 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3745 IncrementalHoareTripleChecker+Unchecked, 4236 mSDsCounter, 1100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9770 IncrementalHoareTripleChecker+Invalid, 14615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1100 mSolverCounterUnsat, 391 mSDtfsCounter, 9770 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2485 GetRequests, 1555 SyntacticMatches, 38 SemanticMatches, 892 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 23402 ImplicationChecksByTransitivity, 181.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=735occurred in iteration=15, InterpolantAutomatonStates: 588, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 1715 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 151 NumberOfFragments, 1754 HoareAnnotationTreeSize, 5 FomulaSimplifications, 2766323 FormulaSimplificationTreeSizeReduction, 149.7s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1927951 FormulaSimplificationTreeSizeReductionInter, 49.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 1944 NumberOfCodeBlocks, 1818 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 2716 ConstructedInterpolants, 263 QuantifiedInterpolants, 28536 SizeOfPredicates, 103 NumberOfNonLiveVariables, 3054 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 45 InterpolantComputations, 5 PerfectInterpolantSequences, 6828/8752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant [2021-12-06 19:12:21,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] [2021-12-06 19:12:21,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_609,QUANTIFIED] [2021-12-06 19:12:21,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_611,QUANTIFIED] [2021-12-06 19:12:21,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] [2021-12-06 19:12:21,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] [2021-12-06 19:12:21,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] [2021-12-06 19:12:21,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] [2021-12-06 19:12:21,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] [2021-12-06 19:12:21,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_369,QUANTIFIED] [2021-12-06 19:12:21,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_371,QUANTIFIED] [2021-12-06 19:12:21,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] [2021-12-06 19:12:21,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] [2021-12-06 19:12:21,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] [2021-12-06 19:12:21,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] [2021-12-06 19:12:21,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_609,QUANTIFIED] [2021-12-06 19:12:21,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_611,QUANTIFIED] [2021-12-06 19:12:21,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_97,QUANTIFIED] [2021-12-06 19:12:21,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] [2021-12-06 19:12:21,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_95,QUANTIFIED] [2021-12-06 19:12:21,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_614,QUANTIFIED] [2021-12-06 19:12:21,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] [2021-12-06 19:12:21,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] [2021-12-06 19:12:21,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_369,QUANTIFIED] [2021-12-06 19:12:21,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_371,QUANTIFIED] [2021-12-06 19:12:21,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~1#1_60,QUANTIFIED] [2021-12-06 19:12:21,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] [2021-12-06 19:12:21,835 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_683,QUANTIFIED] [2021-12-06 19:12:21,835 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] Derived loop invariant: ((((((((((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && 3 == array) && \valid[3] == 1) && 5 <= n) && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && unknown-#memory_int-unknown[array][array + 8] == 0) && array == 0) && unknown-#memory_int-unknown[array][16 + array] == 0) && array == 0) && \valid[2] == 1) && !(2 == array)) && i == 4) && 0 < unknown-#StackHeapBarrier-unknown) && !(array == array)) || (((((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && 3 == array) && \valid[3] == 1) && 5 <= n) && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && unknown-#memory_int-unknown[array][array + 8] == 0) && array == 0) && 2 + i == unknown-#memory_int-unknown[array][i * 4 + array + 8]) && 2 == i) && unknown-#memory_int-unknown[array][16 + array] == 0) && array == 0) && (forall v_ArrVal_609 : int, v_ULTIMATE.start_main_~i~1#1_95 : int, v_ArrVal_619 : [int]int, v_ArrVal_614 : int, v_ULTIMATE.start_main_~i~1#1_97 : int, v_ArrVal_611 : int :: (v_ULTIMATE.start_main_~i~1#1_95 + 1 < v_ULTIMATE.start_main_~i~1#1_97 || unknown-#memory_int-unknown[array := unknown-#memory_int-unknown[array][i * 4 + array := v_ArrVal_609][v_ULTIMATE.start_main_~i~1#1_97 * 4 + array := v_ArrVal_611][v_ULTIMATE.start_main_~i~1#1_95 * 4 + array := v_ArrVal_614]][array := v_ArrVal_619][array][array + 12] == 3) || 1 <= v_ULTIMATE.start_main_~i~1#1_95)) && !(2 == array))) || (((((((((((((((((i + 1 == unknown-#memory_int-unknown[array][i * 4 + array + 4] && 0 == unknown-#memory_int-unknown[array][array + 4]) && 2 == unknown-#memory_int-unknown[array][array + 8]) && i + 1 <= 0) && 3 == array) && \valid[3] == 1) && 5 <= n) && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && unknown-#memory_int-unknown[array][array + 8] == 0) && array == 0) && (forall v_ArrVal_619 : [int]int, v_ArrVal_614 : int :: unknown-#memory_int-unknown[array := unknown-#memory_int-unknown[array][i * 4 + array := v_ArrVal_614]][array := v_ArrVal_619][array][array + 12] == 3)) && unknown-#memory_int-unknown[array][16 + array] == 0) && array == 0) && !(2 == array)) && unknown-#memory_int-unknown[array][0] == 0) && (forall v_ArrVal_688 : [int]int, v_ArrVal_683 : int :: unknown-#memory_int-unknown[array := unknown-#memory_int-unknown[array][i * 4 + array := v_ArrVal_683]][array := v_ArrVal_688][array][array + 16] == 4)) && unknown-#memory_int-unknown[array][array + 4] == 1)) || ((((((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && 4 == unknown-#memory_int-unknown[array][array + 16]) && (forall v_ArrVal_371 : int, v_ULTIMATE.start_main_~i~1#1_60 : int, v_ArrVal_376 : [int]int, v_ArrVal_369 : int :: i < v_ULTIMATE.start_main_~i~1#1_60 + 1 || unknown-#memory_int-unknown[array := unknown-#memory_int-unknown[array][i * 4 + array := v_ArrVal_369][v_ULTIMATE.start_main_~i~1#1_60 * 4 + array := v_ArrVal_371]][array := v_ArrVal_376][array][array + 8] == 2)) && 3 == array) && i == 1) && \valid[3] == 1) && 5 <= n) && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && unknown-#memory_int-unknown[array][array + 8] == 0) && array == 0) && unknown-#memory_int-unknown[array][16 + array] == 0) && array == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(2 == array))) || ((((((((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && 2 == unknown-#memory_int-unknown[array][array + 8]) && 0 <= i) && 3 == array) && \valid[3] == 1) && 5 <= n) && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && unknown-#memory_int-unknown[array][array + 8] == 0) && i <= 0) && array == 0) && unknown-#memory_int-unknown[array][16 + array] == 0) && array == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && !(2 == array)) && (forall v_ArrVal_688 : [int]int, v_ArrVal_683 : int :: unknown-#memory_int-unknown[array := unknown-#memory_int-unknown[array][i * 4 + array := v_ArrVal_683]][array := v_ArrVal_688][array][array + 16] == 4)) && unknown-#memory_int-unknown[array][array + 4] == 1)) || ((((((((((((((0 == unknown-#memory_int-unknown[array][array + 4] && 4 == unknown-#memory_int-unknown[array][array + 16]) && 3 == array) && 3 == i) && \valid[3] == 1) && 5 <= n) && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && unknown-#memory_int-unknown[array][array + 8] == 0) && array == 0) && unknown-#memory_int-unknown[array][16 + array] == 0) && array == 0) && \valid[2] == 1) && !(2 == array)) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((i == unknown-#memory_int-unknown[array][i * 4 + array] && 2 == unknown-#memory_int-unknown[array][array + 8]) && 0 <= i) && 0 <= array) && 3 == array) && 5 <= n) && !(cond == 0)) && i < n + 1) && array == 0) && array <= 0) && i == 4) && unknown-#memory_int-unknown[array][0] == 0) && lh <= i) && !(array == array)) && unknown-#memory_int-unknown[array][array + 4] == 1) || ((((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && 4 == unknown-#memory_int-unknown[array][array + 16]) && 0 <= i) && 0 <= array) && 3 == array) && 5 <= n) && !(cond == 0)) && i < n + 1) && 5 <= i) && array == 0) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && lh <= i) && !(array == array)) && unknown-#memory_int-unknown[array][array + 4] == 1)) || (((((((((((((i == unknown-#memory_int-unknown[array][i * 4 + array] && 2 == unknown-#memory_int-unknown[array][array + 8]) && 4 == unknown-#memory_int-unknown[array][array + 16]) && i == 0) && 0 <= array) && 3 == array) && 5 <= n) && !(3 == array)) && i < n + 1) && array == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && array <= 0) && lh <= i) && unknown-#memory_int-unknown[array][array + 4] == 1)) || ((((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && 4 == unknown-#memory_int-unknown[array][array + 16]) && 0 <= i) && 0 <= array) && 3 == array) && 5 <= n) && !(cond == 0)) && i < n + 1) && array == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && lh <= i) && !(array == array)) && unknown-#memory_int-unknown[array][array + 4] == 1) - InvariantResult [Line: 32]: Loop Invariant [2021-12-06 19:12:21,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,841 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,841 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,842 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,842 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] Derived loop invariant: ((((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && i + 1 <= 0) && 4 == unknown-#memory_int-unknown[array][array + 16]) && (forall v_ArrVal_619 : [int]int :: 3 == unknown-#memory_int-unknown[array := v_ArrVal_619][array][array + 12])) && 0 <= array) && 3 == array) && 5 <= n) && i < n + 1) && array == 0) && 3 + lh <= i) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && unknown-#memory_int-unknown[array][array + 4] == 1) || (((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && i + 1 <= 0) && 4 == unknown-#memory_int-unknown[array][array + 16]) && (forall v_ArrVal_619 : [int]int :: 3 == unknown-#memory_int-unknown[array := v_ArrVal_619][array][array + 12])) && 2 + lh <= i) && 0 <= array) && (4 * rh == 4 * lh || 4 * rh == 4 * i)) && 3 == array) && 5 <= n) && i < n + 1) && array == 0) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && unknown-#memory_int-unknown[array][array + 4] == 1)) || (((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && i + 1 <= 0) && i == 2 + lh) && 4 == unknown-#memory_int-unknown[array][array + 16]) && (forall v_ArrVal_619 : [int]int :: 3 == unknown-#memory_int-unknown[array := v_ArrVal_619][array][array + 12])) && 0 <= array) && 3 == array) && 5 <= n) && unknown-#memory_int-unknown[array][i * 4 + -4 + array] < unknown-#memory_int-unknown[array][lh * 4 + array]) && array == 0) && 2 + lh <= n) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && unknown-#memory_int-unknown[array][array + 4] == 1)) || (((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && i + 1 <= 0) && 4 == unknown-#memory_int-unknown[array][array + 16]) && (forall v_ArrVal_619 : [int]int :: 3 == unknown-#memory_int-unknown[array := v_ArrVal_619][array][array + 12])) && i == lh + 1) && 0 <= array) && 3 == array) && 5 <= n) && i < n + 1) && array == 0) && lh == rh) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && unknown-#memory_int-unknown[array][array + 4] == 1) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && 4 == unknown-#memory_int-unknown[array][array + 16]) && 0 <= i) && 0 <= array) && 3 == array) && 3 == i) && 5 <= n) && !(cond == 0)) && i < n + 1) && array == 0) && i <= 4) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && lh <= i) && !(array == array)) && unknown-#memory_int-unknown[array][array + 4] == 1) || (((((((((((((((4 <= i && 2 == unknown-#memory_int-unknown[array][array + 8]) && 4 == unknown-#memory_int-unknown[array][array + 16]) && 0 <= i) && 0 <= array) && 3 == array) && 5 <= n) && !(cond == 0)) && i < n + 1) && array == 0) && i <= 4) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && lh <= i) && !(array == array)) && unknown-#memory_int-unknown[array][array + 4] == 1)) || (((((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && 4 == unknown-#memory_int-unknown[array][array + 16]) && 0 <= i) && 0 <= array) && 3 == array) && 5 <= n) && !(cond == 0)) && i < n + 1) && array == 0) && i <= 4) && 3 == unknown-#memory_int-unknown[array][array + 12]) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && lh <= i) && !(array == array)) && unknown-#memory_int-unknown[array][array + 4] == 1) - InvariantResult [Line: 30]: Loop Invariant [2021-12-06 19:12:21,845 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,845 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] [2021-12-06 19:12:21,845 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] [2021-12-06 19:12:21,846 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_688,QUANTIFIED] [2021-12-06 19:12:21,846 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_376,QUANTIFIED] [2021-12-06 19:12:21,846 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_619,QUANTIFIED] Derived loop invariant: ((((((((((((((((i + 1 == unknown-#memory_int-unknown[array][i * 4 + array + 4] && 0 == unknown-#memory_int-unknown[array][array + 4]) && i + 1 <= 0) && (forall v_ArrVal_688 : [int]int :: unknown-#memory_int-unknown[array := v_ArrVal_688][array][array + 16] == 4)) && 3 == array) && \valid[3] == 1) && (forall v_ArrVal_376 : [int]int :: 2 == unknown-#memory_int-unknown[array := v_ArrVal_376][array][array + 8])) && 5 <= n) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][array + 8] == 0) && array == 0) && unknown-#memory_int-unknown[array][16 + array] == 0) && array == 0) && lh == 0) && 3 == unknown-#memory_int-unknown[array][array + 12]) && unknown-#memory_int-unknown[array][0] == 0) && unknown-#memory_int-unknown[array][array + 4] == 1) || ((((((((((((2 == unknown-#memory_int-unknown[array][array + 8] && i + 1 <= 0) && 4 == unknown-#memory_int-unknown[array][array + 16]) && (forall v_ArrVal_619 : [int]int :: 3 == unknown-#memory_int-unknown[array := v_ArrVal_619][array][array + 12])) && 0 <= array) && 3 == array) && 5 <= n) && i < n + 1) && array == 0) && array <= 0) && unknown-#memory_int-unknown[array][0] == 0) && lh <= i) && unknown-#memory_int-unknown[array][array + 4] == 1) RESULT: Ultimate proved your program to be correct! [2021-12-06 19:12:21,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5070595b-c7ad-491e-8b2a-3fe5f65f5aca/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE