./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s1lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s1lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8 --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 cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 14:28:39,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:28:39,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:28:39,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:28:39,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:28:39,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:28:39,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:28:39,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:28:39,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:28:39,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:28:39,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:28:39,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:28:39,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:28:39,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:28:39,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:28:39,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:28:39,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:28:39,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:28:39,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:28:39,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:28:39,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:28:39,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:28:39,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:28:39,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:28:39,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:28:39,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:28:39,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:28:39,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:28:39,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:28:39,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:28:39,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:28:39,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:28:39,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:28:39,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:28:39,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:28:39,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:28:39,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:28:39,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:28:39,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:28:39,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:28:39,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:28:39,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 14:28:39,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:28:39,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:28:39,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:28:39,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:28:39,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:28:39,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:28:39,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:28:39,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:28:39,910 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:28:39,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:28:39,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:28:39,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:28:39,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:28:39,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:28:39,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 14:28:39,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:28:39,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 14:28:39,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:28:39,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:28:39,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:28:39,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 14:28:39,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:28:39,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:28:39,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:28:39,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:28:39,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:28:39,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:28:39,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 14:28:39,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:28:39,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:28:39,914 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:28:39,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 14:28:39,914 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:28:39,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:28:39,914 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:28:39,915 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/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_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8 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 -> cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf [2022-12-13 14:28:40,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:28:40,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:28:40,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:28:40,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:28:40,107 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:28:40,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/s1lif.c [2022-12-13 14:28:42,733 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:28:42,874 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:28:42,874 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/sv-benchmarks/c/array-fpi/s1lif.c [2022-12-13 14:28:42,879 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/data/6c9103274/0237a418ef0a4fe5976cfbf6e802c2b6/FLAGa07feed23 [2022-12-13 14:28:42,890 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/data/6c9103274/0237a418ef0a4fe5976cfbf6e802c2b6 [2022-12-13 14:28:42,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:28:42,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:28:42,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:28:42,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:28:42,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:28:42,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:28:42" (1/1) ... [2022-12-13 14:28:42,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544da610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:42, skipping insertion in model container [2022-12-13 14:28:42,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:28:42" (1/1) ... [2022-12-13 14:28:42,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:28:42,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:28:43,020 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/sv-benchmarks/c/array-fpi/s1lif.c[588,601] [2022-12-13 14:28:43,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:28:43,044 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:28:43,054 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/sv-benchmarks/c/array-fpi/s1lif.c[588,601] [2022-12-13 14:28:43,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:28:43,071 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:28:43,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43 WrapperNode [2022-12-13 14:28:43,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:28:43,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:28:43,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:28:43,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:28:43,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,100 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-12-13 14:28:43,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:28:43,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:28:43,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:28:43,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:28:43,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,118 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:28:43,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:28:43,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:28:43,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:28:43,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (1/1) ... [2022-12-13 14:28:43,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:28:43,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:28:43,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:28:43,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:28:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:28:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:28:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:28:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:28:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 14:28:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:28:43,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:28:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 14:28:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:28:43,250 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:28:43,253 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:28:43,393 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:28:43,400 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:28:43,400 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 14:28:43,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:28:43 BoogieIcfgContainer [2022-12-13 14:28:43,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:28:43,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:28:43,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:28:43,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:28:43,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:28:42" (1/3) ... [2022-12-13 14:28:43,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf74eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:28:43, skipping insertion in model container [2022-12-13 14:28:43,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:43" (2/3) ... [2022-12-13 14:28:43,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf74eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:28:43, skipping insertion in model container [2022-12-13 14:28:43,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:28:43" (3/3) ... [2022-12-13 14:28:43,413 INFO L112 eAbstractionObserver]: Analyzing ICFG s1lif.c [2022-12-13 14:28:43,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:28:43,435 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 14:28:43,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:28:43,488 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73a9b335, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:28:43,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 14:28:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 14:28:43,497 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:28:43,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:28:43,498 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:28:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:28:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-12-13 14:28:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:28:43,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423870102] [2022-12-13 14:28:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:43,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:28:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:28:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:28:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423870102] [2022-12-13 14:28:43,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423870102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:28:43,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:28:43,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:28:43,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352823110] [2022-12-13 14:28:43,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:28:43,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 14:28:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:28:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 14:28:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:28:43,680 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:28:43,698 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-12-13 14:28:43,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 14:28:43,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 14:28:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:28:43,709 INFO L225 Difference]: With dead ends: 40 [2022-12-13 14:28:43,709 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 14:28:43,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:28:43,716 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:28:43,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:28:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 14:28:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 14:28:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-12-13 14:28:43,748 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-12-13 14:28:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:28:43,749 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-12-13 14:28:43,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-12-13 14:28:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 14:28:43,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:28:43,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:28:43,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:28:43,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:28:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:28:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-12-13 14:28:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:28:43,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254423791] [2022-12-13 14:28:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:28:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:28:43,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:28:43,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254423791] [2022-12-13 14:28:43,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254423791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:28:43,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:28:43,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:28:43,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955531221] [2022-12-13 14:28:43,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:28:43,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:28:43,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:28:43,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:28:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:28:43,874 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:28:43,939 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-12-13 14:28:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:28:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 14:28:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:28:43,941 INFO L225 Difference]: With dead ends: 36 [2022-12-13 14:28:43,941 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 14:28:43,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:28:43,942 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:28:43,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:28:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 14:28:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-12-13 14:28:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-12-13 14:28:43,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-12-13 14:28:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:28:43,949 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-12-13 14:28:43,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-12-13 14:28:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 14:28:43,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:28:43,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:28:43,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:28:43,951 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:28:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:28:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-12-13 14:28:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:28:43,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429572151] [2022-12-13 14:28:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:28:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:28:44,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:28:44,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429572151] [2022-12-13 14:28:44,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429572151] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:28:44,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151936828] [2022-12-13 14:28:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:44,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:28:44,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:28:44,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:28:44,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 14:28:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:44,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 14:28:44,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:28:44,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 14:28:44,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:28:44,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:28:45,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 14:28:45,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-12-13 14:28:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:28:45,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:28:45,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:28:45,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-12-13 14:28:45,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:28:45,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-13 14:28:45,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:28:45,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-12-13 14:28:45,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-13 14:28:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:28:45,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151936828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:28:45,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:28:45,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-12-13 14:28:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036672341] [2022-12-13 14:28:45,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:28:45,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 14:28:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:28:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 14:28:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2022-12-13 14:28:45,563 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:28:46,291 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-12-13 14:28:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 14:28:46,291 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 14:28:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:28:46,293 INFO L225 Difference]: With dead ends: 53 [2022-12-13 14:28:46,293 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 14:28:46,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=405, Invalid=1401, Unknown=0, NotChecked=0, Total=1806 [2022-12-13 14:28:46,294 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:28:46,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 80 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:28:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 14:28:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-12-13 14:28:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-12-13 14:28:46,300 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-12-13 14:28:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:28:46,300 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-12-13 14:28:46,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-12-13 14:28:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 14:28:46,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:28:46,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:28:46,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:28:46,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:28:46,502 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:28:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:28:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-12-13 14:28:46,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:28:46,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477678245] [2022-12-13 14:28:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:28:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:46,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:28:46,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477678245] [2022-12-13 14:28:46,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477678245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:28:46,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844397709] [2022-12-13 14:28:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:46,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:28:46,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:28:46,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:28:46,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 14:28:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:46,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 14:28:46,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:28:46,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-12-13 14:28:46,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:28:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:46,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:28:46,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-13 14:28:46,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 14:28:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:46,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844397709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:28:46,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:28:46,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 14:28:46,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022965721] [2022-12-13 14:28:46,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:28:46,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:28:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:28:46,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:28:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:28:46,829 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:28:46,898 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-12-13 14:28:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:28:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 14:28:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:28:46,899 INFO L225 Difference]: With dead ends: 48 [2022-12-13 14:28:46,900 INFO L226 Difference]: Without dead ends: 37 [2022-12-13 14:28:46,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 14:28:46,901 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:28:46,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:28:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-13 14:28:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-12-13 14:28:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-12-13 14:28:46,911 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-12-13 14:28:46,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:28:46,911 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-12-13 14:28:46,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-12-13 14:28:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 14:28:46,912 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:28:46,912 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:28:46,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 14:28:47,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:28:47,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:28:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:28:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-12-13 14:28:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:28:47,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587465313] [2022-12-13 14:28:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:28:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:28:47,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587465313] [2022-12-13 14:28:47,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587465313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:28:47,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682276608] [2022-12-13 14:28:47,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:28:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:28:47,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:28:47,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:28:47,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 14:28:47,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:28:47,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:28:47,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 14:28:47,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:28:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:47,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:28:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:47,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682276608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:28:47,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:28:47,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 14:28:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230050251] [2022-12-13 14:28:47,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:28:47,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 14:28:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:28:47,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 14:28:47,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:28:47,420 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:28:47,496 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-12-13 14:28:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:28:47,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 14:28:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:28:47,497 INFO L225 Difference]: With dead ends: 70 [2022-12-13 14:28:47,497 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 14:28:47,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-12-13 14:28:47,498 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:28:47,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 27 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:28:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 14:28:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-12-13 14:28:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-13 14:28:47,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-12-13 14:28:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:28:47,504 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-13 14:28:47,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-13 14:28:47,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 14:28:47,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:28:47,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:28:47,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 14:28:47,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:28:47,707 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:28:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:28:47,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-12-13 14:28:47,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:28:47,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894982322] [2022-12-13 14:28:47,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:28:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:47,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:28:47,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894982322] [2022-12-13 14:28:47,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894982322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:28:47,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574298922] [2022-12-13 14:28:47,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 14:28:47,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:28:47,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:28:47,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:28:47,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 14:28:47,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 14:28:47,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:28:47,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 14:28:47,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:28:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:47,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:28:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:28:47,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574298922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:28:47,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:28:47,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 14:28:47,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001000917] [2022-12-13 14:28:47,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:28:47,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 14:28:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:28:47,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 14:28:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:28:47,956 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:28:48,029 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-12-13 14:28:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:28:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 14:28:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:28:48,030 INFO L225 Difference]: With dead ends: 39 [2022-12-13 14:28:48,030 INFO L226 Difference]: Without dead ends: 31 [2022-12-13 14:28:48,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 14:28:48,031 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:28:48,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 24 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:28:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-13 14:28:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-12-13 14:28:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-12-13 14:28:48,035 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-12-13 14:28:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:28:48,036 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-12-13 14:28:48,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:28:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-12-13 14:28:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 14:28:48,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:28:48,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:28:48,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 14:28:48,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 14:28:48,238 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:28:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:28:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-12-13 14:28:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:28:48,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438028769] [2022-12-13 14:28:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:28:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:28:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:28:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:28:49,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:28:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438028769] [2022-12-13 14:28:49,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438028769] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:28:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897013454] [2022-12-13 14:28:49,613 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 14:28:49,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:28:49,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:28:49,614 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:28:49,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 14:28:49,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 14:28:49,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:28:49,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 14:28:49,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:28:49,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 14:28:49,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:28:49,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:28:49,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:28:49,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 14:28:50,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:28:50,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-12-13 14:28:50,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:28:50,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 40 [2022-12-13 14:28:50,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-12-13 14:28:50,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 31 [2022-12-13 14:28:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:28:50,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:28:51,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:28:51,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-12-13 14:28:59,012 WARN L233 SmtUtils]: Spent 7.60s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:29:11,348 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:29:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:11,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897013454] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:29:11,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:29:11,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 48 [2022-12-13 14:29:11,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990206956] [2022-12-13 14:29:11,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:29:11,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-13 14:29:11,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:11,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-13 14:29:11,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-12-13 14:29:11,460 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:27,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:29:51,710 WARN L233 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:29:54,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:29:55,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:30:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:30:15,410 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2022-12-13 14:30:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 14:30:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 14:30:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:30:15,412 INFO L225 Difference]: With dead ends: 91 [2022-12-13 14:30:15,412 INFO L226 Difference]: Without dead ends: 74 [2022-12-13 14:30:15,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 74.4s TimeCoverageRelationStatistics Valid=882, Invalid=4969, Unknown=1, NotChecked=0, Total=5852 [2022-12-13 14:30:15,415 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 125 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:30:15,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 117 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 708 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2022-12-13 14:30:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-13 14:30:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2022-12-13 14:30:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-12-13 14:30:15,434 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 27 [2022-12-13 14:30:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:30:15,434 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-12-13 14:30:15,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-12-13 14:30:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 14:30:15,435 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:30:15,435 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:30:15,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 14:30:15,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:30:15,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:30:15,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:30:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-12-13 14:30:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:30:15,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102087411] [2022-12-13 14:30:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:30:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:30:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:30:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:30:17,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:30:17,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102087411] [2022-12-13 14:30:17,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102087411] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:30:17,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022289272] [2022-12-13 14:30:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:30:17,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:30:17,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:30:17,008 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:30:17,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 14:30:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:30:17,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 14:30:17,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:30:17,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 14:30:17,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:17,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 14:30:17,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 14:30:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:30:17,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:30:18,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-12-13 14:30:18,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-13 14:30:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:30:18,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022289272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:30:18,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:30:18,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-12-13 14:30:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679964943] [2022-12-13 14:30:18,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:30:18,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 14:30:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:30:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 14:30:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-13 14:30:18,653 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:30:20,284 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-12-13 14:30:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:30:20,285 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 14:30:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:30:20,285 INFO L225 Difference]: With dead ends: 74 [2022-12-13 14:30:20,286 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 14:30:20,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-13 14:30:20,287 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:30:20,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 14:30:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 14:30:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-12-13 14:30:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-12-13 14:30:20,304 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 27 [2022-12-13 14:30:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:30:20,304 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-12-13 14:30:20,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-12-13 14:30:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 14:30:20,305 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:30:20,306 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:30:20,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 14:30:20,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 14:30:20,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:30:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:30:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-12-13 14:30:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:30:20,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20067803] [2022-12-13 14:30:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:30:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:30:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:30:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 14:30:20,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:30:20,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20067803] [2022-12-13 14:30:20,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20067803] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:30:20,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760429100] [2022-12-13 14:30:20,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 14:30:20,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:30:20,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:30:20,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:30:20,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 14:30:21,082 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 14:30:21,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:30:21,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 14:30:21,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:30:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 14:30:22,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:30:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 14:30:22,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760429100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:30:22,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:30:22,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 14:30:22,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947334328] [2022-12-13 14:30:22,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:30:22,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 14:30:22,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:30:22,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 14:30:22,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 14:30:22,661 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:30:24,048 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-12-13 14:30:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 14:30:24,050 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 14:30:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:30:24,050 INFO L225 Difference]: With dead ends: 86 [2022-12-13 14:30:24,051 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 14:30:24,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-12-13 14:30:24,052 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:30:24,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 29 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 14:30:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 14:30:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-12-13 14:30:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-12-13 14:30:24,064 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-12-13 14:30:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:30:24,064 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-12-13 14:30:24,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-12-13 14:30:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 14:30:24,066 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:30:24,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:30:24,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 14:30:24,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 14:30:24,268 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:30:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:30:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-12-13 14:30:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:30:24,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808788213] [2022-12-13 14:30:24,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:30:24,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:30:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:30:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:30:24,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:30:24,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808788213] [2022-12-13 14:30:24,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808788213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:30:24,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621806803] [2022-12-13 14:30:24,798 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 14:30:24,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:30:24,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:30:24,799 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:30:24,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 14:30:24,864 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 14:30:24,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:30:24,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 14:30:24,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:30:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 14:30:25,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:30:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 14:30:26,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621806803] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:30:26,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:30:26,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 14:30:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669171730] [2022-12-13 14:30:26,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:30:26,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 14:30:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:30:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 14:30:26,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 14:30:26,510 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:30:28,221 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-12-13 14:30:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:30:28,222 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 14:30:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:30:28,222 INFO L225 Difference]: With dead ends: 48 [2022-12-13 14:30:28,223 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 14:30:28,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-12-13 14:30:28,224 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:30:28,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 21 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 14:30:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 14:30:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-12-13 14:30:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-12-13 14:30:28,233 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-12-13 14:30:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:30:28,233 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-12-13 14:30:28,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:30:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-12-13 14:30:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 14:30:28,234 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:30:28,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:30:28,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 14:30:28,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:30:28,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:30:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:30:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-12-13 14:30:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:30:28,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13212129] [2022-12-13 14:30:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:30:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:30:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:30:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:30:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:30:40,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13212129] [2022-12-13 14:30:40,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13212129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:30:40,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512820401] [2022-12-13 14:30:40,721 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 14:30:40,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:30:40,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:30:40,723 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:30:40,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 14:30:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:30:40,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 14:30:40,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:30:40,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:30:40,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 14:30:41,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:30:41,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:30:42,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:30:44,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 14:30:45,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:45,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-12-13 14:30:46,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:46,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:46,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 73 [2022-12-13 14:30:48,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:30:48,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:48,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:48,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 77 [2022-12-13 14:30:50,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:50,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:50,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:30:50,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:30:50,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 69 [2022-12-13 14:30:51,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 55 [2022-12-13 14:30:52,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 46 [2022-12-13 14:30:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:30:52,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:31:06,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:31:06,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-12-13 14:31:09,477 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 2)) (not (= (select v_arrayElimArr_4 .cse1) 2)) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5))))) (+ .cse7 3)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (not (= (select v_arrayElimArr_4 .cse1) 2)) (< (+ .cse7 1) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12)))))) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-12-13 14:31:12,584 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 3) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 5)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-12-13 14:31:15,751 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 5) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 7)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-12-13 14:31:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-13 14:31:16,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512820401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:31:16,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:31:16,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 65 [2022-12-13 14:31:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533827878] [2022-12-13 14:31:16,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:31:16,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-13 14:31:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:16,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-13 14:31:16,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=3320, Unknown=3, NotChecked=366, Total=4160 [2022-12-13 14:31:16,048 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:31:22,594 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse9 .cse8)) (.cse0 (select .cse9 .cse7)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 2) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 1)) .cse8 (+ .cse1 1)) .cse7 (+ .cse0 1))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6 1)))))) (not (= .cse6 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse10 5) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15)))))) (not (= .cse11 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (not (= 2 (select v_arrayElimArr_4 .cse7)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse16 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (< (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse19 .cse20))))) (+ .cse10 7)) (not (= 2 (select v_arrayElimArr_4 .cse7)))))))) is different from false [2022-12-13 14:31:25,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 3) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 5)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (select .cse20 .cse7)) (.cse13 (select .cse20 .cse6)) (.cse19 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse13 1)) (not (= .cse14 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 2) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse19 1)) .cse7 (+ .cse14 1)) .cse6 (+ .cse13 1))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse18 .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse18 .cse19 1)))))) (not (= .cse19 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-12-13 14:31:41,688 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 104 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:31:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:51,837 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-12-13 14:31:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 14:31:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 14:31:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:51,839 INFO L225 Difference]: With dead ends: 82 [2022-12-13 14:31:51,839 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 14:31:51,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1868 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=636, Invalid=4349, Unknown=5, NotChecked=710, Total=5700 [2022-12-13 14:31:51,840 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:51,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 191 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1067 Invalid, 0 Unknown, 152 Unchecked, 11.0s Time] [2022-12-13 14:31:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 14:31:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2022-12-13 14:31:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:31:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-12-13 14:31:51,853 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2022-12-13 14:31:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:51,853 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-12-13 14:31:51,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:31:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-12-13 14:31:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 14:31:51,853 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:51,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:31:51,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 14:31:52,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:31:52,055 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:31:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-12-13 14:31:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:52,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999283951] [2022-12-13 14:31:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 14:31:53,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:53,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999283951] [2022-12-13 14:31:53,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999283951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:31:53,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287952054] [2022-12-13 14:31:53,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:31:53,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:31:53,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:31:53,845 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:31:53,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 14:31:53,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:31:53,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:31:53,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 14:31:53,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:31:54,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 14:31:55,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:31:55,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 14:31:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:31:55,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 14:31:55,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:31:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 14:31:56,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:31:56,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-12-13 14:31:56,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-13 14:31:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 14:31:57,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287952054] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:31:57,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:31:57,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-12-13 14:31:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473026465] [2022-12-13 14:31:57,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:31:57,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 14:31:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:57,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 14:31:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-12-13 14:31:57,525 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:02,527 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-12-13 14:32:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 14:32:02,528 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 14:32:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:02,529 INFO L225 Difference]: With dead ends: 76 [2022-12-13 14:32:02,529 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 14:32:02,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 14:32:02,531 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:02,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 14:32:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 14:32:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-12-13 14:32:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-12-13 14:32:02,546 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2022-12-13 14:32:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:02,546 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-12-13 14:32:02,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-12-13 14:32:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 14:32:02,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:02,547 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:02,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 14:32:02,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:02,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:32:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-12-13 14:32:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:02,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898495979] [2022-12-13 14:32:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 14:32:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898495979] [2022-12-13 14:32:03,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898495979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:03,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141792944] [2022-12-13 14:32:03,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:32:03,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:03,573 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:03,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 14:32:03,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:32:03,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:32:03,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 14:32:03,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 14:32:04,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 14:32:05,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141792944] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:32:05,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:32:05,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 14:32:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813959688] [2022-12-13 14:32:05,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:05,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 14:32:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 14:32:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 14:32:05,868 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:07,575 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-12-13 14:32:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 14:32:07,576 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 14:32:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:07,577 INFO L225 Difference]: With dead ends: 102 [2022-12-13 14:32:07,577 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 14:32:07,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-12-13 14:32:07,578 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:07,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 34 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 14:32:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 14:32:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-12-13 14:32:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-12-13 14:32:07,596 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-12-13 14:32:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:07,597 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-12-13 14:32:07,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-12-13 14:32:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 14:32:07,597 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:07,598 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:07,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 14:32:07,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:07,799 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:32:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-12-13 14:32:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:07,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416605313] [2022-12-13 14:32:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 14:32:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416605313] [2022-12-13 14:32:08,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416605313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376047257] [2022-12-13 14:32:08,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 14:32:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:08,700 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:08,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 14:32:08,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 14:32:08,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:32:08,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 14:32:08,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 14:32:09,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 14:32:10,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376047257] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:32:10,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:32:10,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 14:32:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874569557] [2022-12-13 14:32:10,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:10,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 14:32:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 14:32:10,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 14:32:10,794 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:13,125 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-12-13 14:32:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 14:32:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 14:32:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:13,126 INFO L225 Difference]: With dead ends: 57 [2022-12-13 14:32:13,126 INFO L226 Difference]: Without dead ends: 45 [2022-12-13 14:32:13,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-12-13 14:32:13,128 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:13,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 30 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 14:32:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-13 14:32:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-12-13 14:32:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-12-13 14:32:13,145 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-12-13 14:32:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:13,145 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-12-13 14:32:13,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:32:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-12-13 14:32:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 14:32:13,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:13,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:13,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 14:32:13,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 14:32:13,348 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:32:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-12-13 14:32:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:13,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292653440] [2022-12-13 14:32:13,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:32:28,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:28,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292653440] [2022-12-13 14:32:28,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292653440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:28,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418985046] [2022-12-13 14:32:28,103 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 14:32:28,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:28,105 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:28,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e66aa74-3c7b-4ef2-949e-854b9db587b2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 14:32:28,204 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 14:32:28,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:32:28,206 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 109 conjunts are in the unsatisfiable core [2022-12-13 14:32:28,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:28,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:32:29,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 14:32:29,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:32:30,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:32:30,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:32:31,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:32:34,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 14:32:37,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:37,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:32:37,095 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:32:37,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2022-12-13 14:32:39,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:39,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:39,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:39,534 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:32:39,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 49 [2022-12-13 14:32:41,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:41,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:41,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:41,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:41,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:41,904 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:32:41,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 61 [2022-12-13 14:32:45,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:32:45,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:45,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:45,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:45,777 INFO L321 Elim1Store]: treesize reduction 59, result has 24.4 percent of original size [2022-12-13 14:32:45,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 67 treesize of output 70 [2022-12-13 14:32:47,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:47,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:47,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:47,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:47,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:32:47,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:47,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:47,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-12-13 14:32:49,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:49,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:49,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:49,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:49,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:49,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:49,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:32:49,659 INFO L321 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2022-12-13 14:32:49,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 67 treesize of output 70 [2022-12-13 14:32:51,634 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-12-13 14:32:51,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 63 treesize of output 55 [2022-12-13 14:32:52,666 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:52,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 42 [2022-12-13 14:32:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:32:53,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:33:30,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:30,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-12-13 14:33:44,904 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:33:44,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 386 treesize of output 1 [2022-12-13 14:33:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:44,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418985046] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:33:44,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:33:44,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 32] total 92 [2022-12-13 14:33:44,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174692711] [2022-12-13 14:33:44,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:33:44,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-12-13 14:33:44,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:44,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-12-13 14:33:44,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=6938, Unknown=0, NotChecked=0, Total=8372 [2022-12-13 14:33:44,912 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 92 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 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) [2022-12-13 14:34:08,398 WARN L233 SmtUtils]: Spent 18.57s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:35:33,648 WARN L233 SmtUtils]: Spent 47.18s on a formula simplification. DAG size of input: 241 DAG size of output: 166 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:36:20,289 WARN L233 SmtUtils]: Spent 33.99s on a formula simplification. DAG size of input: 127 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:36:24,387 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse99 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse96 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse72 (select .cse28 .cse96)) (.cse83 (select .cse28 .cse99)) (.cse73 (+ .cse98 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (select .cse28 .cse73)) (.cse43 (store .cse28 .cse99 (+ .cse83 1))) (.cse97 (+ .cse72 1)) (.cse56 (+ .cse98 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse75 (select .cse28 .cse56)) (.cse95 (store .cse43 .cse96 .cse97)) (.cse74 (+ .cse64 1))) (let ((.cse2 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse15 (store .cse28 .cse96 .cse97)) (.cse20 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse71 (store .cse95 .cse73 .cse74)) (.cse57 (+ .cse75 1)) (.cse44 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse5 (* c_~N~0 2)) (.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (= .cse5 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse95))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse90 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse94 (select .cse95 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse89 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse89 .cse90 .cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse94)))))))) (.cse46 (<= (mod c_~N~0 4294967296) 536870911)) (.cse3 (not .cse44)) (.cse16 (< 4 c_~N~0)) (.cse17 (not (< 3 c_~N~0))) (.cse19 (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse13) 2)) (not (= 2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select v_arrayElimArr_5 .cse14) 2)) (not (= 2 (select v_arrayElimArr_5 .cse12))) (= .cse5 (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse88 (select .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 2 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) 2 .cse87 .cse88)))))))))) (.cse45 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse1 (not (= .cse83 1))) (.cse31 (= .cse5 (let ((.cse82 (store .cse71 .cse56 .cse57))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse82))) (let ((.cse77 (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse80 (select .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse81 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse79 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse79 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse78 .cse79 .cse80 .cse81))))))))) (.cse34 (not .cse20)) (.cse35 (not (= .cse75 1))) (.cse36 (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (.cse55 (store .cse15 .cse73 .cse74)) (.cse0 (not (= .cse72 1))) (.cse47 (= .cse5 (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse65 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse69 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse70 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse69 .cse70)))))))) (.cse32 (not (= .cse64 1))) (.cse18 (not .cse2)) (.cse33 (not (= |c_ULTIMATE.start_main_#t~mem8#1| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse2 .cse3 (= .cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse9 .cse10 .cse11)))))))) (or .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse21 (select .cse28 .cse13)) (.cse29 (select .cse28 .cse14)) (.cse26 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (select .cse28 .cse12))) (or (not (= .cse21 1)) (= .cse5 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse26 1)) .cse14 (+ .cse29 1)) .cse13 (+ .cse21 1)) .cse12 (+ .cse30 1))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 1 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse25 .cse26 1 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse25 .cse26 1 .cse27))))))) (not (= .cse29 1)) .cse16 .cse17 (not (= .cse26 1)) (not (= .cse30 1)))) (or .cse0 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse0 .cse2 .cse33 .cse3 .cse4) (or .cse16 .cse17 .cse19 .cse34 .cse36) (or .cse1 (= (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse42 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse39 .cse40 .cse41 .cse42)))))) .cse5) .cse44 .cse45) .cse46 (or .cse0 .cse1 .cse47 .cse32 .cse18 .cse20) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse46) (and (not .cse46) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse0 (= .cse5 (let ((.cse54 (store .cse55 .cse56 .cse57))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse53 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse52 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse48 .cse49 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse52 .cse53)))))))) .cse32 .cse34 .cse35 .cse36) (or .cse16 .cse2 .cse17 .cse19 .cse3) (or .cse44 .cse16 .cse17 .cse19 .cse45) (or .cse0 .cse1 .cse31 .cse32 .cse34 .cse35 .cse36) (or .cse0 (= (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse59 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse58 .cse59 .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse63)))))) .cse5) .cse32 .cse18 .cse20) (or .cse0 .cse47 .cse32 .cse18 .cse33 .cse20))))))))) is different from true [2022-12-13 14:36:26,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:36:28,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:37:18,763 WARN L233 SmtUtils]: Spent 43.41s on a formula simplification. DAG size of input: 145 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:37:22,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:37:59,589 WARN L233 SmtUtils]: Spent 29.91s on a formula simplification. DAG size of input: 123 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:38:30,742 WARN L233 SmtUtils]: Spent 16.72s on a formula simplification. DAG size of input: 140 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:38:32,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:39:08,471 WARN L233 SmtUtils]: Spent 28.42s on a formula simplification. DAG size of input: 141 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:39:26,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:39:55,027 WARN L233 SmtUtils]: Spent 23.42s on a formula simplification. DAG size of input: 119 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:40:02,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:40:25,114 WARN L233 SmtUtils]: Spent 17.55s on a formula simplification. DAG size of input: 137 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:40:50,875 WARN L233 SmtUtils]: Spent 13.42s on a formula simplification. DAG size of input: 134 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:40:53,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:41:08,956 WARN L233 SmtUtils]: Spent 10.17s on a formula simplification. DAG size of input: 115 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:41:25,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 14:42:06,399 WARN L233 SmtUtils]: Spent 11.22s on a formula simplification. DAG size of input: 128 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)