./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/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_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- 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:45:53,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:45:53,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:45:53,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:45:53,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:45:53,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:45:53,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:45:53,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:45:53,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:45:53,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:45:53,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:45:53,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:45:53,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:45:53,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:45:53,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:45:53,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:45:53,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:45:53,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:45:53,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:45:53,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:45:53,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:45:53,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:45:53,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:45:53,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:45:53,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:45:53,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:45:53,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:45:53,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:45:53,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:45:53,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:45:53,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:45:53,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:45:53,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:45:53,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:45:53,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:45:53,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:45:53,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:45:53,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:45:53,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:45:53,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:45:53,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:45:53,705 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 14:45:53,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:45:53,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:45:53,721 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:45:53,721 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:45:53,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:45:53,722 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:45:53,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:45:53,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:45:53,723 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:45:53,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:45:53,723 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:45:53,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:45:53,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:45:53,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:45:53,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:45:53,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:45:53,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:45:53,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:45:53,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:45:53,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:45:53,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:45:53,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:45:53,726 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:45:53,726 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:45:53,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:45:53,726 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:45:53,726 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_4f132ec4-7bca-41f9-9200-435fa9057064/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_4f132ec4-7bca-41f9-9200-435fa9057064/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2022-12-13 14:45:53,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:45:53,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:45:53,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:45:53,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:45:53,925 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:45:53,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-12-13 14:45:56,388 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:45:56,575 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:45:56,576 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-12-13 14:45:56,584 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/data/195d7efb1/440f75e849fc4f72b0d01b21ce941d36/FLAG4685aba3e [2022-12-13 14:45:56,972 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/data/195d7efb1/440f75e849fc4f72b0d01b21ce941d36 [2022-12-13 14:45:56,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:45:56,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:45:56,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:45:56,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:45:56,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:45:56,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:45:56" (1/1) ... [2022-12-13 14:45:56,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a23980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:56, skipping insertion in model container [2022-12-13 14:45:56,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:45:56" (1/1) ... [2022-12-13 14:45:56,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:45:57,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:45:57,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:45:57,197 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:45:57,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:45:57,242 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:45:57,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57 WrapperNode [2022-12-13 14:45:57,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:45:57,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:45:57,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:45:57,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:45:57,249 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:45:57" (1/1) ... [2022-12-13 14:45:57,257 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:45:57" (1/1) ... [2022-12-13 14:45:57,271 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2022-12-13 14:45:57,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:45:57,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:45:57,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:45:57,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:45:57,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,289 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:45:57,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:45:57,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:45:57,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:45:57,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (1/1) ... [2022-12-13 14:45:57,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:45:57,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:57,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:45:57,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:45:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 14:45:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:45:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 14:45:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 14:45:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:45:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:45:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:45:57,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:45:57,436 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:45:57,437 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:45:57,614 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:45:57,618 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:45:57,619 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 14:45:57,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:45:57 BoogieIcfgContainer [2022-12-13 14:45:57,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:45:57,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:45:57,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:45:57,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:45:57,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:45:56" (1/3) ... [2022-12-13 14:45:57,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689a9d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:45:57, skipping insertion in model container [2022-12-13 14:45:57,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:57" (2/3) ... [2022-12-13 14:45:57,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689a9d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:45:57, skipping insertion in model container [2022-12-13 14:45:57,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:45:57" (3/3) ... [2022-12-13 14:45:57,627 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2022-12-13 14:45:57,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:45:57,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-12-13 14:45:57,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:45:57,679 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@62ea5c81, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:45:57,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-12-13 14:45:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 14:45:57,687 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:57,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 14:45:57,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-12-13 14:45:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:57,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565446907] [2022-12-13 14:45:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:57,840 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:45:57,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:57,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565446907] [2022-12-13 14:45:57,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565446907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:57,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:57,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:45:57,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222220695] [2022-12-13 14:45:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:57,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:45:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:45:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:45:57,872 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:45:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:57,962 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-12-13 14:45:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:45:57,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-12-13 14:45:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:57,973 INFO L225 Difference]: With dead ends: 63 [2022-12-13 14:45:57,973 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 14:45:57,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:45:57,978 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:57,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:45:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 14:45:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-12-13 14:45:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-12-13 14:45:58,008 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2022-12-13 14:45:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:58,009 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-12-13 14:45:58,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:45:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-12-13 14:45:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 14:45:58,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:58,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 14:45:58,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:45:58,010 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:58,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-12-13 14:45:58,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:58,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588441406] [2022-12-13 14:45:58,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:58,077 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:45:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:58,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588441406] [2022-12-13 14:45:58,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588441406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:58,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:58,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:45:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5695140] [2022-12-13 14:45:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:58,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:45:58,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:58,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:45:58,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:45:58,081 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:45:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:58,140 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-12-13 14:45:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:45:58,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-12-13 14:45:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:58,141 INFO L225 Difference]: With dead ends: 55 [2022-12-13 14:45:58,142 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 14:45:58,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:45:58,143 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:58,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:45:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 14:45:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-12-13 14:45:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 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:45:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-13 14:45:58,147 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 3 [2022-12-13 14:45:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:58,147 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-13 14:45:58,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:45:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-13 14:45:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 14:45:58,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:58,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:58,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:45:58,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897518, now seen corresponding path program 1 times [2022-12-13 14:45:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:58,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318989211] [2022-12-13 14:45:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:58,217 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:45:58,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:58,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318989211] [2022-12-13 14:45:58,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318989211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:58,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:58,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:45:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462582473] [2022-12-13 14:45:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:58,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:58,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:58,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:58,220 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:45:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:58,303 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-12-13 14:45:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:45:58,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-13 14:45:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:58,305 INFO L225 Difference]: With dead ends: 58 [2022-12-13 14:45:58,305 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 14:45:58,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:58,307 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:58,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 31 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:45:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 14:45:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-12-13 14:45:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 50 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:45:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-12-13 14:45:58,311 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2022-12-13 14:45:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:58,311 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-12-13 14:45:58,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:45:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-12-13 14:45:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 14:45:58,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:58,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:58,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:45:58,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897519, now seen corresponding path program 1 times [2022-12-13 14:45:58,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:58,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741586005] [2022-12-13 14:45:58,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:58,427 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:45:58,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:58,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741586005] [2022-12-13 14:45:58,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741586005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:58,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:58,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:45:58,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456359846] [2022-12-13 14:45:58,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:58,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:58,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:58,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:58,429 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:45:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:58,533 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-12-13 14:45:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:58,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-13 14:45:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:58,535 INFO L225 Difference]: With dead ends: 87 [2022-12-13 14:45:58,535 INFO L226 Difference]: Without dead ends: 87 [2022-12-13 14:45:58,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:58,536 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:58,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 53 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:45:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-13 14:45:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-12-13 14:45:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.528301886792453) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 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:45:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-12-13 14:45:58,540 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2022-12-13 14:45:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:58,541 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-12-13 14:45:58,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:45:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-12-13 14:45:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 14:45:58,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:58,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:58,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:45:58,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:58,542 INFO L85 PathProgramCache]: Analyzing trace with hash 233083786, now seen corresponding path program 1 times [2022-12-13 14:45:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:58,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958338491] [2022-12-13 14:45:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:58,597 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:45:58,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:58,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958338491] [2022-12-13 14:45:58,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958338491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:58,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:58,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:45:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137564977] [2022-12-13 14:45:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:58,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:58,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:58,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:58,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:58,599 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:58,661 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-12-13 14:45:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:58,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 14:45:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:58,662 INFO L225 Difference]: With dead ends: 90 [2022-12-13 14:45:58,662 INFO L226 Difference]: Without dead ends: 90 [2022-12-13 14:45:58,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:58,663 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:58,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 58 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:45:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-13 14:45:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-12-13 14:45:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.490566037735849) internal successors, (79), 66 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-12-13 14:45:58,667 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2022-12-13 14:45:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:58,668 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-12-13 14:45:58,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-12-13 14:45:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 14:45:58,668 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:58,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:58,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:45:58,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:58,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash 683852015, now seen corresponding path program 1 times [2022-12-13 14:45:58,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:58,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373660254] [2022-12-13 14:45:58,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:58,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:58,804 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:45:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:58,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373660254] [2022-12-13 14:45:58,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373660254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:58,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:58,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:45:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572357647] [2022-12-13 14:45:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:58,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:58,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:58,806 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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:45:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:58,842 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-12-13 14:45:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:45:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:45:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:58,843 INFO L225 Difference]: With dead ends: 66 [2022-12-13 14:45:58,843 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 14:45:58,843 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:45:58,844 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:58,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:45:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 14:45:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-12-13 14:45:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.471698113207547) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-12-13 14:45:58,851 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2022-12-13 14:45:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:58,851 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-12-13 14:45:58,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:45:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-12-13 14:45:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 14:45:58,852 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:58,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:58,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:45:58,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -833158411, now seen corresponding path program 1 times [2022-12-13 14:45:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:58,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074194700] [2022-12-13 14:45:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:59,048 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:45:59,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:59,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074194700] [2022-12-13 14:45:59,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074194700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:59,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:59,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:45:59,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955716985] [2022-12-13 14:45:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:59,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:45:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:59,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:45:59,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:45:59,050 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:59,160 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-12-13 14:45:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:45:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 14:45:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:59,161 INFO L225 Difference]: With dead ends: 73 [2022-12-13 14:45:59,161 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 14:45:59,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:45:59,162 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:59,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 84 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:45:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 14:45:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-12-13 14:45:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 60 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:45:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-12-13 14:45:59,167 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 15 [2022-12-13 14:45:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:59,167 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-12-13 14:45:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-12-13 14:45:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 14:45:59,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:59,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:59,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:45:59,168 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash -833147426, now seen corresponding path program 1 times [2022-12-13 14:45:59,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:59,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138148802] [2022-12-13 14:45:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:59,225 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:45:59,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:59,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138148802] [2022-12-13 14:45:59,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138148802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:45:59,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:45:59,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:45:59,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704349866] [2022-12-13 14:45:59,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:45:59,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:45:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:45:59,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:45:59,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:45:59,227 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:45:59,287 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-12-13 14:45:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:45:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 14:45:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:45:59,289 INFO L225 Difference]: With dead ends: 77 [2022-12-13 14:45:59,289 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 14:45:59,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:45:59,290 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:45:59,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:45:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 14:45:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-12-13 14:45:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-12-13 14:45:59,294 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 15 [2022-12-13 14:45:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:45:59,294 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-12-13 14:45:59,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:45:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-12-13 14:45:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 14:45:59,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:45:59,295 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:45:59,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:45:59,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:45:59,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:45:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 321145941, now seen corresponding path program 1 times [2022-12-13 14:45:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:45:59,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895471293] [2022-12-13 14:45:59,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:45:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:45:59,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895471293] [2022-12-13 14:45:59,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895471293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:45:59,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114321630] [2022-12-13 14:45:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:45:59,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:45:59,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:45:59,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:45:59,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 14:45:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:45:59,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 14:45:59,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:45:59,569 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:45:59,575 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:45:59,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:45:59,621 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 21 treesize of output 20 [2022-12-13 14:45:59,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:45:59,629 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 21 treesize of output 20 [2022-12-13 14:45:59,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:45:59,653 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 21 treesize of output 20 [2022-12-13 14:45:59,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:45:59,661 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 21 treesize of output 20 [2022-12-13 14:45:59,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:45:59,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:45:59,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:45:59,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:45:59,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-12-13 14:45:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:45:59,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:00,050 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 10 treesize of output 8 [2022-12-13 14:46:00,056 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 12 [2022-12-13 14:46:00,063 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 10 treesize of output 8 [2022-12-13 14:46:00,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:00,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114321630] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:00,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:00,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-12-13 14:46:00,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14620919] [2022-12-13 14:46:00,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:00,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 14:46:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:00,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 14:46:00,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 14:46:00,079 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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:46:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:00,376 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-12-13 14:46:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 14:46:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 14:46:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:00,378 INFO L225 Difference]: With dead ends: 85 [2022-12-13 14:46:00,378 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 14:46:00,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-12-13 14:46:00,379 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:00,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 203 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:46:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 14:46:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-12-13 14:46:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 80 states have internal predecessors, (97), 0 states have call successors, (0), 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:46:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-12-13 14:46:00,386 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2022-12-13 14:46:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:00,387 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-12-13 14:46:00,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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:46:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-12-13 14:46:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 14:46:00,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:00,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:00,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:46:00,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 14:46:00,588 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1365588675, now seen corresponding path program 1 times [2022-12-13 14:46:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:00,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921241647] [2022-12-13 14:46:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:00,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:00,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:00,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921241647] [2022-12-13 14:46:00,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921241647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:00,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795356287] [2022-12-13 14:46:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:00,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:00,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:00,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:00,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 14:46:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:00,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 14:46:00,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:00,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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:46:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:00,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:00,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795356287] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:00,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:00,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 14:46:00,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778906597] [2022-12-13 14:46:00,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:00,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:46:00,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:00,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:46:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:46:00,813 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:00,887 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-12-13 14:46:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:46:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 14:46:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:00,888 INFO L225 Difference]: With dead ends: 83 [2022-12-13 14:46:00,888 INFO L226 Difference]: Without dead ends: 72 [2022-12-13 14:46:00,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:46:00,889 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:00,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:46:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-13 14:46:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-12-13 14:46:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 71 states have internal predecessors, (87), 0 states have call successors, (0), 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:46:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-12-13 14:46:00,893 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 19 [2022-12-13 14:46:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:00,893 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-12-13 14:46:00,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-12-13 14:46:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 14:46:00,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:00,895 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:00,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 14:46:01,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 14:46:01,097 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash -190050214, now seen corresponding path program 1 times [2022-12-13 14:46:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582483765] [2022-12-13 14:46:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:01,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582483765] [2022-12-13 14:46:01,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582483765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:46:01,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:46:01,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:46:01,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444637271] [2022-12-13 14:46:01,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:46:01,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:46:01,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:01,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:46:01,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:46:01,238 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:01,301 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-12-13 14:46:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:46:01,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 14:46:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:01,302 INFO L225 Difference]: With dead ends: 81 [2022-12-13 14:46:01,302 INFO L226 Difference]: Without dead ends: 81 [2022-12-13 14:46:01,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:46:01,302 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:01,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 51 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:46:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-13 14:46:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-12-13 14:46:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-12-13 14:46:01,306 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2022-12-13 14:46:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:01,306 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-12-13 14:46:01,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-12-13 14:46:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 14:46:01,307 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:01,307 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:01,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:46:01,308 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash -36338646, now seen corresponding path program 1 times [2022-12-13 14:46:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:01,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543941353] [2022-12-13 14:46:01,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:01,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:01,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543941353] [2022-12-13 14:46:01,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543941353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:46:01,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:46:01,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:46:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027798913] [2022-12-13 14:46:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:46:01,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:46:01,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:01,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:46:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:46:01,578 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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:46:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:01,707 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-12-13 14:46:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:46:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 14:46:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:01,708 INFO L225 Difference]: With dead ends: 87 [2022-12-13 14:46:01,708 INFO L226 Difference]: Without dead ends: 87 [2022-12-13 14:46:01,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 14:46:01,709 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:01,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:46:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-13 14:46:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-12-13 14:46:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.375) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 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:46:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-12-13 14:46:01,712 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2022-12-13 14:46:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:01,712 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-12-13 14:46:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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:46:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-12-13 14:46:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 14:46:01,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:01,713 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:01,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 14:46:01,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1126497925, now seen corresponding path program 1 times [2022-12-13 14:46:01,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:01,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134566083] [2022-12-13 14:46:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:01,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134566083] [2022-12-13 14:46:01,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134566083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:46:01,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:46:01,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:46:01,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678033997] [2022-12-13 14:46:01,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:46:01,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:46:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:46:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:46:01,969 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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:46:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:02,121 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-12-13 14:46:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:46:02,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-12-13 14:46:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:02,122 INFO L225 Difference]: With dead ends: 86 [2022-12-13 14:46:02,122 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 14:46:02,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 14:46:02,123 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:02,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 131 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:46:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 14:46:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2022-12-13 14:46:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 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:46:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-12-13 14:46:02,126 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2022-12-13 14:46:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:02,126 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-12-13 14:46:02,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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:46:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-12-13 14:46:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 14:46:02,127 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:02,127 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:02,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 14:46:02,127 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:02,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash -561697204, now seen corresponding path program 1 times [2022-12-13 14:46:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:02,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598927758] [2022-12-13 14:46:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:02,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598927758] [2022-12-13 14:46:02,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598927758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:46:02,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:46:02,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:46:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299308491] [2022-12-13 14:46:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:46:02,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:46:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:02,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:46:02,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:46:02,329 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:02,445 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-12-13 14:46:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:46:02,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 14:46:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:02,447 INFO L225 Difference]: With dead ends: 69 [2022-12-13 14:46:02,447 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 14:46:02,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-12-13 14:46:02,448 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:02,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:46:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 14:46:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-12-13 14:46:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2022-12-13 14:46:02,449 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 26 [2022-12-13 14:46:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:02,450 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2022-12-13 14:46:02,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-12-13 14:46:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 14:46:02,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:02,451 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, 1, 1, 1, 1] [2022-12-13 14:46:02,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 14:46:02,451 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846250, now seen corresponding path program 1 times [2022-12-13 14:46:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:02,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572659883] [2022-12-13 14:46:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:02,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572659883] [2022-12-13 14:46:02,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572659883] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:02,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779744105] [2022-12-13 14:46:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:02,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:02,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:02,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:02,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 14:46:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:02,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 14:46:02,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:02,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:46:02,718 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:46:02,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:46:02,735 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:46:02,770 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:46:02,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-13 14:46:02,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:02,800 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 31 treesize of output 26 [2022-12-13 14:46:02,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:02,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:02,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-12-13 14:46:02,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 14:46:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:02,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:03,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:03,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2022-12-13 14:46:03,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:03,253 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 18 treesize of output 19 [2022-12-13 14:46:03,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:03,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2022-12-13 14:46:03,266 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 9 treesize of output 7 [2022-12-13 14:46:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:03,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779744105] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:03,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:03,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 22 [2022-12-13 14:46:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991126172] [2022-12-13 14:46:03,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:03,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 14:46:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 14:46:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=439, Unknown=3, NotChecked=0, Total=506 [2022-12-13 14:46:03,333 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:04,144 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-12-13 14:46:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 14:46:04,145 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 14:46:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:04,146 INFO L225 Difference]: With dead ends: 95 [2022-12-13 14:46:04,146 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 14:46:04,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=940, Unknown=3, NotChecked=0, Total=1190 [2022-12-13 14:46:04,147 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 207 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:04,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 176 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 14:46:04,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 14:46:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2022-12-13 14:46:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.360655737704918) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 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:46:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-12-13 14:46:04,150 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2022-12-13 14:46:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:04,150 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-12-13 14:46:04,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-12-13 14:46:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 14:46:04,151 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:04,151 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, 1, 1, 1, 1] [2022-12-13 14:46:04,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 14:46:04,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 14:46:04,353 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:04,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846251, now seen corresponding path program 1 times [2022-12-13 14:46:04,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:04,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811166525] [2022-12-13 14:46:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:04,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811166525] [2022-12-13 14:46:04,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811166525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:04,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767036014] [2022-12-13 14:46:04,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:04,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:04,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:04,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:04,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 14:46:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:04,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 14:46:04,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:04,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:46:04,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:46:04,861 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:46:04,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:46:04,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 14:46:04,887 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:46:04,894 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:46:04,923 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:46:04,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-12-13 14:46:04,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 14:46:04,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:04,969 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 21 treesize of output 20 [2022-12-13 14:46:04,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:04,975 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 31 treesize of output 26 [2022-12-13 14:46:05,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:05,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 14:46:05,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:05,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:46:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:05,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:05,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:05,375 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 18 treesize of output 19 [2022-12-13 14:46:05,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:05,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2022-12-13 14:46:05,386 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 9 treesize of output 7 [2022-12-13 14:46:05,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:05,407 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 37 treesize of output 38 [2022-12-13 14:46:05,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:05,412 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 29 treesize of output 30 [2022-12-13 14:46:05,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:05,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:05,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 14:46:05,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:05,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:05,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-12-13 14:46:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:05,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767036014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:05,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:05,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-12-13 14:46:05,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862738681] [2022-12-13 14:46:05,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:05,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 14:46:05,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:05,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 14:46:05,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=439, Unknown=1, NotChecked=0, Total=506 [2022-12-13 14:46:05,637 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:06,315 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-12-13 14:46:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 14:46:06,315 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 14:46:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:06,316 INFO L225 Difference]: With dead ends: 111 [2022-12-13 14:46:06,316 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 14:46:06,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=934, Unknown=1, NotChecked=0, Total=1190 [2022-12-13 14:46:06,316 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 156 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:06,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 164 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:46:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 14:46:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2022-12-13 14:46:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 84 states have internal predecessors, (101), 0 states have call successors, (0), 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:46:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-12-13 14:46:06,318 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 26 [2022-12-13 14:46:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:06,318 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-12-13 14:46:06,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-12-13 14:46:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 14:46:06,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:06,319 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:06,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 14:46:06,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 14:46:06,520 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1476440114, now seen corresponding path program 1 times [2022-12-13 14:46:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:06,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385077939] [2022-12-13 14:46:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:06,703 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:46:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:06,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385077939] [2022-12-13 14:46:06,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385077939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:06,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837630629] [2022-12-13 14:46:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:06,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:06,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:06,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:06,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 14:46:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:06,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 14:46:06,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:06,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:46:06,813 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:46:06,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:46:06,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:46:06,864 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:46:06,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-13 14:46:06,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:06,892 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 30 treesize of output 25 [2022-12-13 14:46:06,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:06,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:06,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2022-12-13 14:46:06,932 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:46:06,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:07,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:07,074 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 19 treesize of output 20 [2022-12-13 14:46:07,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:07,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-12-13 14:46:07,084 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 18 [2022-12-13 14:46:07,203 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:46:07,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837630629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:07,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:07,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-12-13 14:46:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747560589] [2022-12-13 14:46:07,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:07,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 14:46:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 14:46:07,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=352, Unknown=6, NotChecked=0, Total=420 [2022-12-13 14:46:07,206 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 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:46:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:07,767 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-12-13 14:46:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 14:46:07,767 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 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) Word has length 27 [2022-12-13 14:46:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:07,768 INFO L225 Difference]: With dead ends: 110 [2022-12-13 14:46:07,768 INFO L226 Difference]: Without dead ends: 110 [2022-12-13 14:46:07,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=807, Unknown=6, NotChecked=0, Total=1056 [2022-12-13 14:46:07,770 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 227 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:07,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 184 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:46:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-13 14:46:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2022-12-13 14:46:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.356164383561644) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-12-13 14:46:07,772 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 27 [2022-12-13 14:46:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:07,772 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-12-13 14:46:07,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 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:46:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-12-13 14:46:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 14:46:07,773 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:07,773 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:07,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 14:46:07,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 14:46:07,974 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:07,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash -328711838, now seen corresponding path program 1 times [2022-12-13 14:46:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:07,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607507178] [2022-12-13 14:46:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:07,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:08,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607507178] [2022-12-13 14:46:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607507178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:46:08,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:46:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:46:08,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156407489] [2022-12-13 14:46:08,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:46:08,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:46:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:46:08,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:46:08,222 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:08,413 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-12-13 14:46:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 14:46:08,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 14:46:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:08,414 INFO L225 Difference]: With dead ends: 98 [2022-12-13 14:46:08,414 INFO L226 Difference]: Without dead ends: 98 [2022-12-13 14:46:08,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-12-13 14:46:08,414 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:08,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 109 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:46:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-13 14:46:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-12-13 14:46:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2022-12-13 14:46:08,417 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 29 [2022-12-13 14:46:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:08,417 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2022-12-13 14:46:08,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2022-12-13 14:46:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 14:46:08,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:08,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:08,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 14:46:08,419 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506277, now seen corresponding path program 1 times [2022-12-13 14:46:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:08,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394197702] [2022-12-13 14:46:08,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:08,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:08,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394197702] [2022-12-13 14:46:08,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394197702] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:08,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671048470] [2022-12-13 14:46:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:08,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:08,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:08,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 14:46:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:08,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 14:46:08,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:08,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:46:08,964 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:46:08,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:46:08,971 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:46:08,984 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:46:08,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-13 14:46:09,008 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 14:46:09,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 14:46:09,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:09,020 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 39 treesize of output 30 [2022-12-13 14:46:09,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:09,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:09,206 INFO L321 Elim1Store]: treesize reduction 10, result has 68.8 percent of original size [2022-12-13 14:46:09,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 41 [2022-12-13 14:46:09,290 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:46:09,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 14:46:09,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 14:46:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:09,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:46:09,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:09,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 465 [2022-12-13 14:46:10,991 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse7 (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))))) (and (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= .cse0 v_prenex_4) (= .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4)))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |c_ULTIMATE.start_main_~list~0#1.base|)) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse2 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= .cse2 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse3 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4))) (let ((.cse4 (select .cse3 v_prenex_5))) (or (not (= (select .cse3 8) .cse4)) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse4 v_prenex_4) (not (<= 0 v_prenex_5)))))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= .cse5 v_prenex_4) (not (<= 0 v_prenex_5)) (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_5)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |c_ULTIMATE.start_main_~list~0#1.base|))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse6 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (= .cse6 v_prenex_4) (= .cse6 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (or .cse7 (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |c_ULTIMATE.start_main_~list~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse9 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (= .cse9 v_prenex_4)))))) (or .cse7 (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (= .cse10 v_prenex_4) (= .cse10 |c_ULTIMATE.start_main_~list~0#1.base|))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= .cse11 v_prenex_4) (= .cse11 |c_ULTIMATE.start_main_~list~0#1.base|)))) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse12 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= .cse12 v_prenex_4) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse12 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|))))))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse13 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_4))) (= .cse13 |c_ULTIMATE.start_main_~list~0#1.base|)))))) (forall ((v_prenex_4 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) (forall ((v_prenex_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse14 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_prenex_4) v_prenex_5))) (or (= .cse14 v_prenex_4) (forall ((v_ArrVal_814 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (= .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|) |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (= .cse14 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) is different from false [2022-12-13 14:46:11,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:11,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2022-12-13 14:46:11,219 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 74 treesize of output 68 [2022-12-13 14:46:11,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:11,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:11,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2022-12-13 14:46:11,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:11,252 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 18 [2022-12-13 14:46:11,259 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 26 treesize of output 24 [2022-12-13 14:46:11,305 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-12-13 14:46:11,312 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-12-13 14:46:11,320 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-12-13 14:46:11,326 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-12-13 14:46:11,334 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 1 [2022-12-13 14:46:11,339 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-12-13 14:46:11,345 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,346 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-12-13 14:46:11,352 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-12-13 14:46:11,357 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-12-13 14:46:11,363 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,363 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-12-13 14:46:11,368 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 1 [2022-12-13 14:46:11,373 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-12-13 14:46:11,377 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,377 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-12-13 14:46:11,381 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,381 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2022-12-13 14:46:11,385 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,385 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2022-12-13 14:46:11,392 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:46:11,392 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2022-12-13 14:46:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:11,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671048470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:46:11,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:46:11,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 37 [2022-12-13 14:46:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740691519] [2022-12-13 14:46:11,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:46:11,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 14:46:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:46:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 14:46:11,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1173, Unknown=1, NotChecked=70, Total=1406 [2022-12-13 14:46:11,446 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:28,385 WARN L233 SmtUtils]: Spent 16.59s on a formula simplification. DAG size of input: 126 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:46:43,175 WARN L233 SmtUtils]: Spent 14.30s on a formula simplification. DAG size of input: 137 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:46:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:46:43,695 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-12-13 14:46:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 14:46:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 14:46:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:46:43,696 INFO L225 Difference]: With dead ends: 89 [2022-12-13 14:46:43,696 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 14:46:43,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=538, Invalid=2544, Unknown=2, NotChecked=108, Total=3192 [2022-12-13 14:46:43,699 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 251 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 69 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:46:43,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 200 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 575 Invalid, 6 Unknown, 62 Unchecked, 0.4s Time] [2022-12-13 14:46:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 14:46:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-12-13 14:46:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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:46:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-12-13 14:46:43,702 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2022-12-13 14:46:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:46:43,702 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-12-13 14:46:43,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:46:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-12-13 14:46:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 14:46:43,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:46:43,703 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:46:43,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 14:46:43,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:43,904 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:46:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:46:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash 678559033, now seen corresponding path program 1 times [2022-12-13 14:46:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:46:43,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700079682] [2022-12-13 14:46:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:46:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:46:44,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700079682] [2022-12-13 14:46:44,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700079682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:46:44,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536084734] [2022-12-13 14:46:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:46:44,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:46:44,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:46:44,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:46:44,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 14:46:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:46:44,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 14:46:44,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:46:44,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:46:44,580 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:46:44,585 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:46:44,611 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:46:44,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:46:44,648 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 19 treesize of output 18 [2022-12-13 14:46:44,654 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 19 treesize of output 18 [2022-12-13 14:46:44,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:44,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:44,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:44,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 62 [2022-12-13 14:46:44,706 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-13 14:46:44,706 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-12-13 14:46:44,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:44,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-12-13 14:46:44,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:44,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:44,770 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:46:44,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 48 [2022-12-13 14:46:45,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:45,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:45,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:46:45,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:46:45,275 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 14:46:45,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 34 [2022-12-13 14:46:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:46:45,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:47:13,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:47:13,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:47:13,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:47:13,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:47:13,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:47:14,064 INFO L321 Elim1Store]: treesize reduction 206, result has 50.8 percent of original size [2022-12-13 14:47:14,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3377 treesize of output 1894 [2022-12-13 14:47:14,223 INFO L321 Elim1Store]: treesize reduction 239, result has 21.4 percent of original size [2022-12-13 14:47:14,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52216 treesize of output 13123 [2022-12-13 14:47:14,523 INFO L321 Elim1Store]: treesize reduction 19, result has 51.3 percent of original size [2022-12-13 14:47:14,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11732 treesize of output 10826 [2022-12-13 14:47:14,625 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-13 14:47:14,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 10779 treesize of output 9873 [2022-12-13 14:47:14,739 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 13 treesize of output 4 [2022-12-13 14:47:14,782 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 13 treesize of output 4 [2022-12-13 14:48:48,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:48:48,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:48:48,371 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-12-13 14:48:48,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 248 treesize of output 232 [2022-12-13 14:48:48,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:48:48,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:48:48,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:48:48,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:48:48,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-12-13 14:48:48,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:48:48,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:48:48,488 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-13 14:48:48,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 722 treesize of output 1 [2022-12-13 14:48:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:48:48,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536084734] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:48:48,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:48:48,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 39 [2022-12-13 14:48:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973886548] [2022-12-13 14:48:48,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:48:48,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 14:48:48,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:48:48,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 14:48:48,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1331, Unknown=7, NotChecked=0, Total=1482 [2022-12-13 14:48:48,612 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:49:23,695 WARN L233 SmtUtils]: Spent 25.80s on a formula simplification. DAG size of input: 122 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:49:50,743 WARN L233 SmtUtils]: Spent 23.10s on a formula simplification. DAG size of input: 129 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:49:53,090 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 [0, 1] [2022-12-13 14:50:06,522 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 [0, 1] [2022-12-13 14:50:25,384 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 [0, 1] [2022-12-13 14:50:27,404 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 [0, 1] [2022-12-13 14:50:39,409 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 [0, 1] [2022-12-13 14:50:41,430 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 [0, 1] [2022-12-13 14:50:43,627 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 [0, 1] [2022-12-13 14:50:45,938 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 [0, 1] [2022-12-13 14:50:47,952 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 [0, 1] [2022-12-13 14:50:51,525 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 [0, 1] [2022-12-13 14:51:03,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 14:51:05,138 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 [0, 1] [2022-12-13 14:51:10,637 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 [0, 1] [2022-12-13 14:51:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:51:22,875 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2022-12-13 14:51:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 14:51:22,876 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 14:51:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:51:22,876 INFO L225 Difference]: With dead ends: 146 [2022-12-13 14:51:22,876 INFO L226 Difference]: Without dead ends: 146 [2022-12-13 14:51:22,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 148.5s TimeCoverageRelationStatistics Valid=757, Invalid=4329, Unknown=26, NotChecked=0, Total=5112 [2022-12-13 14:51:22,877 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 331 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 83 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:51:22,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 393 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 958 Invalid, 16 Unknown, 0 Unchecked, 34.2s Time] [2022-12-13 14:51:22,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-13 14:51:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 113. [2022-12-13 14:51:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 112 states have internal predecessors, (128), 0 states have call successors, (0), 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:51:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2022-12-13 14:51:22,880 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 31 [2022-12-13 14:51:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:51:22,880 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2022-12-13 14:51:22,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:51:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2022-12-13 14:51:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 14:51:22,880 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:51:22,880 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, 1, 1, 1, 1] [2022-12-13 14:51:22,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 14:51:23,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:51:23,081 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:51:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:51:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash 678570018, now seen corresponding path program 1 times [2022-12-13 14:51:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:51:23,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706404868] [2022-12-13 14:51:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:51:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:51:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:51:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:51:23,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:51:23,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706404868] [2022-12-13 14:51:23,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706404868] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:51:23,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213760970] [2022-12-13 14:51:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:51:23,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:51:23,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:51:23,313 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:51:23,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 14:51:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:51:23,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 14:51:23,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:51:23,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:51:23,434 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:51:23,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:51:23,468 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:51:23,507 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:51:23,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:51:23,598 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 49 treesize of output 40 [2022-12-13 14:51:23,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:51:23,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:51:23,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-12-13 14:51:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:51:23,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:51:24,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:51:24,102 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 18 treesize of output 19 [2022-12-13 14:51:24,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:51:24,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2022-12-13 14:51:24,119 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 9 treesize of output 7 [2022-12-13 14:51:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:51:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213760970] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:51:24,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:51:24,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2022-12-13 14:51:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259672689] [2022-12-13 14:51:24,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:51:24,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 14:51:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:51:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 14:51:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=356, Unknown=2, NotChecked=0, Total=420 [2022-12-13 14:51:24,300 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:51:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:51:25,720 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-12-13 14:51:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 14:51:25,721 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 14:51:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:51:25,721 INFO L225 Difference]: With dead ends: 134 [2022-12-13 14:51:25,721 INFO L226 Difference]: Without dead ends: 134 [2022-12-13 14:51:25,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=811, Unknown=2, NotChecked=0, Total=1056 [2022-12-13 14:51:25,722 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 154 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 14:51:25,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 189 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 14:51:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-13 14:51:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2022-12-13 14:51:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 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:51:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 130 transitions. [2022-12-13 14:51:25,724 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 130 transitions. Word has length 31 [2022-12-13 14:51:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:51:25,724 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 130 transitions. [2022-12-13 14:51:25,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:51:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2022-12-13 14:51:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 14:51:25,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:51:25,725 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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:51:25,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 14:51:25,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 14:51:25,927 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:51:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:51:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1131545711, now seen corresponding path program 2 times [2022-12-13 14:51:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:51:25,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875178948] [2022-12-13 14:51:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:51:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:51:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:51:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:51:26,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:51:26,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875178948] [2022-12-13 14:51:26,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875178948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:51:26,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698137842] [2022-12-13 14:51:26,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:51:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:51:26,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:51:26,508 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:51:26,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 14:51:26,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:51:26,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:51:26,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-13 14:51:26,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:51:26,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:51:26,644 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:51:26,648 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:51:26,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:51:26,659 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 21 treesize of output 20 [2022-12-13 14:51:26,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:51:26,667 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 21 treesize of output 20 [2022-12-13 14:51:26,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:51:26,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:51:26,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 14:51:26,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:51:26,721 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 21 treesize of output 20 [2022-12-13 14:51:26,796 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:51:26,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:51:26,840 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 19 treesize of output 18 [2022-12-13 14:51:26,847 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 21 treesize of output 21 [2022-12-13 14:51:26,892 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:51:26,892 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 57 [2022-12-13 14:51:26,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2022-12-13 14:51:26,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:51:26,964 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:51:26,964 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2022-12-13 14:51:26,969 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 29 treesize of output 25 [2022-12-13 14:51:27,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:51:27,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:51:27,485 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-12-13 14:51:27,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 51 [2022-12-13 14:51:27,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:51:27,506 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 2 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 14:51:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:51:27,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:51:27,977 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:52:05,346 INFO L321 Elim1Store]: treesize reduction 73, result has 40.2 percent of original size [2022-12-13 14:52:05,346 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 4 case distinctions, treesize of input 276 treesize of output 128 [2022-12-13 14:52:05,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:52:05,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62 [2022-12-13 14:52:05,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:52:05,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:52:05,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 117 [2022-12-13 14:52:05,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:52:05,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 133 [2022-12-13 14:52:05,411 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 47 treesize of output 45 [2022-12-13 14:52:05,439 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 6 treesize of output 4 [2022-12-13 14:52:05,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:52:05,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2022-12-13 14:52:05,509 INFO L321 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2022-12-13 14:52:05,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2022-12-13 14:52:05,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:52:05,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:52:05,575 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:52:05,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 51 [2022-12-13 14:52:05,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:52:05,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:52:05,770 INFO L321 Elim1Store]: treesize reduction 264, result has 18.0 percent of original size [2022-12-13 14:52:05,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60432 treesize of output 9550 [2022-12-13 14:52:05,924 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-12-13 14:52:05,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 10286 treesize of output 8968 [2022-12-13 14:52:05,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:52:05,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:52:05,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7433 treesize of output 6433 [2022-12-13 14:52:06,178 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 14:52:06,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 4675 treesize of output 4055 [2022-12-13 14:52:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:52:08,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698137842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:52:08,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:52:08,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 20] total 45 [2022-12-13 14:52:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259612182] [2022-12-13 14:52:08,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:52:08,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 14:52:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:08,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 14:52:08,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1800, Unknown=15, NotChecked=0, Total=1980 [2022-12-13 14:52:08,954 INFO L87 Difference]: Start difference. First operand 115 states and 130 transitions. Second operand has 45 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 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:52:24,548 WARN L233 SmtUtils]: Spent 12.80s on a formula simplification. DAG size of input: 128 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:52:26,760 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:52:35,448 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:52:55,362 WARN L233 SmtUtils]: Spent 17.49s on a formula simplification. DAG size of input: 155 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:52:59,108 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 [0, 1] [2022-12-13 14:53:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:53:10,863 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2022-12-13 14:53:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 14:53:10,864 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 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:53:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:53:10,864 INFO L225 Difference]: With dead ends: 168 [2022-12-13 14:53:10,864 INFO L226 Difference]: Without dead ends: 168 [2022-12-13 14:53:10,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 91.6s TimeCoverageRelationStatistics Valid=441, Invalid=3702, Unknown=17, NotChecked=0, Total=4160 [2022-12-13 14:53:10,865 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 237 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 82 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-12-13 14:53:10,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 396 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 851 Invalid, 34 Unknown, 0 Unchecked, 9.9s Time] [2022-12-13 14:53:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-12-13 14:53:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2022-12-13 14:53:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 153 states have internal predecessors, (173), 0 states have call successors, (0), 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:53:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2022-12-13 14:53:10,869 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 34 [2022-12-13 14:53:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:53:10,869 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2022-12-13 14:53:10,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 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:53:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2022-12-13 14:53:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 14:53:10,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:53:10,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:53:10,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 14:53:11,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 14:53:11,072 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:53:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:53:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash -718179577, now seen corresponding path program 2 times [2022-12-13 14:53:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:53:11,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440284896] [2022-12-13 14:53:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:53:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:53:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:53:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440284896] [2022-12-13 14:53:11,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440284896] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:53:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623317797] [2022-12-13 14:53:11,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:53:11,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:11,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:53:11,582 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:53:11,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 14:53:11,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:53:11,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:53:11,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 14:53:11,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:53:11,759 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 14:53:11,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-12-13 14:53:11,826 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:53:11,896 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:53:11,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2022-12-13 14:53:11,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:53:11,980 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 61 treesize of output 44 [2022-12-13 14:53:12,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:53:12,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2022-12-13 14:53:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:53:12,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:53:12,782 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_54| Int)) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_54|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_54| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_54|)))) is different from false [2022-12-13 14:53:12,797 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_54| Int) (v_ArrVal_1205 Int)) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1205) |v_ULTIMATE.start_main_~list~0#1.offset_54|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_54| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_54|)))) is different from false [2022-12-13 14:53:12,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1203 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_54| Int) (v_ArrVal_1205 Int)) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1203) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1205) |v_ULTIMATE.start_main_~list~0#1.offset_54|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_54| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_54|)))) is different from false [2022-12-13 14:53:12,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:53:12,846 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 33 treesize of output 34 [2022-12-13 14:53:12,851 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 60 treesize of output 56 [2022-12-13 14:53:12,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:53:12,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-12-13 14:53:12,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:53:12,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:53:12,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-12-13 14:53:23,477 WARN L233 SmtUtils]: Spent 10.44s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:53:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:53:27,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623317797] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:53:27,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:53:27,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 32 [2022-12-13 14:53:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956351248] [2022-12-13 14:53:27,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:53:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 14:53:27,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:53:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 14:53:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=779, Unknown=3, NotChecked=174, Total=1056 [2022-12-13 14:53:27,746 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 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:53:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:53:29,098 INFO L93 Difference]: Finished difference Result 168 states and 186 transitions. [2022-12-13 14:53:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 14:53:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 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 35 [2022-12-13 14:53:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:53:29,099 INFO L225 Difference]: With dead ends: 168 [2022-12-13 14:53:29,099 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 14:53:29,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=183, Invalid=1232, Unknown=3, NotChecked=222, Total=1640 [2022-12-13 14:53:29,100 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 14:53:29,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 309 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 621 Invalid, 0 Unknown, 171 Unchecked, 0.8s Time] [2022-12-13 14:53:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 14:53:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-12-13 14:53:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 137 states have (on average 1.218978102189781) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 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:53:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2022-12-13 14:53:29,103 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 35 [2022-12-13 14:53:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:53:29,103 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2022-12-13 14:53:29,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.75) internal successors, (88), 33 states have internal predecessors, (88), 0 states have call successors, (0), 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:53:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2022-12-13 14:53:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 14:53:29,103 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:53:29,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:53:29,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 14:53:29,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 14:53:29,305 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:53:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:53:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash 108065457, now seen corresponding path program 1 times [2022-12-13 14:53:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:53:29,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763145018] [2022-12-13 14:53:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:53:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:53:29,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:53:29,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763145018] [2022-12-13 14:53:29,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763145018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:53:29,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:53:29,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:53:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189981712] [2022-12-13 14:53:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:53:29,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:53:29,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:53:29,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:53:29,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:53:29,521 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:53:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:53:29,846 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-12-13 14:53:29,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 14:53:29,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 14:53:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:53:29,847 INFO L225 Difference]: With dead ends: 157 [2022-12-13 14:53:29,848 INFO L226 Difference]: Without dead ends: 157 [2022-12-13 14:53:29,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-12-13 14:53:29,848 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:53:29,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 101 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:53:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-13 14:53:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2022-12-13 14:53:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 137 states have (on average 1.197080291970803) internal successors, (164), 148 states have internal predecessors, (164), 0 states have call successors, (0), 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:53:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-12-13 14:53:29,851 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 36 [2022-12-13 14:53:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:53:29,851 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-12-13 14:53:29,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:53:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-12-13 14:53:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 14:53:29,851 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:53:29,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:53:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 14:53:29,852 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:53:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:53:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1288592364, now seen corresponding path program 1 times [2022-12-13 14:53:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:53:29,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151977325] [2022-12-13 14:53:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:53:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:53:30,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:53:30,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151977325] [2022-12-13 14:53:30,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151977325] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:53:30,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142256921] [2022-12-13 14:53:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:30,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:30,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:53:30,978 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:53:30,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 14:53:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:31,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 14:53:31,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:53:31,183 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 14:53:31,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-12-13 14:53:31,269 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:53:31,352 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:53:31,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2022-12-13 14:53:31,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:53:31,566 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 81 treesize of output 60 [2022-12-13 14:53:32,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:53:32,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:53:32,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:53:32,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 68 [2022-12-13 14:53:32,709 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~y~0#1.base|) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (let ((.cse1 (exists ((v_ArrVal_1347 Int) (v_DerPreprocessor_4 Int) (v_arrayElimCell_169 Int) (v_DerPreprocessor_3 Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_21| Int)) (let ((.cse5 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~y~0#1.base| v_DerPreprocessor_4))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_169 v_ArrVal_1347) |v_ULTIMATE.start_main_#t~mem11#1.base_21| 0)) (= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= 0 (select .cse5 v_arrayElimCell_169)))))) (.cse2 (exists ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_21| Int)) (let ((.cse4 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~y~0#1.base| v_DerPreprocessor_4))) (and (= |c_#valid| (store .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_21| 0)) (= (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (select .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_21|) 0))))) (.cse0 (not (= |c_ULTIMATE.start_main_~y~0#1.offset| 0)))) (or (and (<= 0 (+ 7 |c_ULTIMATE.start_main_~y~0#1.offset|)) (or (and .cse0 .cse1) .cse2)) (and (<= (+ |c_ULTIMATE.start_main_~y~0#1.offset| 9) 0) (or .cse1 .cse2)) (and .cse0 (exists ((v_ArrVal_1347 Int) (v_DerPreprocessor_4 Int) (v_arrayElimCell_169 Int) (v_DerPreprocessor_3 Int)) (let ((.cse3 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~y~0#1.base| v_DerPreprocessor_4))) (and (= (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= 0 (select .cse3 v_arrayElimCell_169)) (= |c_#valid| (store (store .cse3 v_arrayElimCell_169 v_ArrVal_1347) |c_ULTIMATE.start_main_~list~0#1.base| 0)))))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base|) 0)) is different from true [2022-12-13 14:53:33,289 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1.base| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~y~0#1.base|) 0) (exists ((|v_ULTIMATE.start_main_~y~0#1.base_77| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (|v_ULTIMATE.start_main_#t~mem11#1.base_21| Int)) (let ((.cse0 (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~y~0#1.base| v_DerPreprocessor_3) |v_ULTIMATE.start_main_~y~0#1.base_77| v_DerPreprocessor_4))) (and (= (select .cse0 |ULTIMATE.start_main_~y~0#1.base|) 1) (= |c_#valid| (store (store (store .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_21| 0) |v_ULTIMATE.start_main_~y~0#1.base_77| 0) |ULTIMATE.start_main_~y~0#1.base| 0)) (not (= |ULTIMATE.start_main_~y~0#1.base| |v_ULTIMATE.start_main_~y~0#1.base_77|)) (= (select .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_21|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~y~0#1.base_77|) 0)))))) is different from true [2022-12-13 14:53:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 14:53:33,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:53:33,998 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_59| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (store (store (store |c_#valid| (select .cse0 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_59|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_59|)))) is different from false [2022-12-13 14:53:34,030 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_59| |c_ULTIMATE.start_main_~y~0#1.offset|)) (= (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|))) (store (store (store |c_#valid| (select .cse0 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_59|) 0)) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_59|)))) is different from false [2022-12-13 14:53:34,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:53:34,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2022-12-13 14:53:34,355 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 88 treesize of output 82 [2022-12-13 14:53:34,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:53:34,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:53:34,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 58 [2022-12-13 14:53:34,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:53:34,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:53:34,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 79 [2022-12-13 14:55:53,830 WARN L233 SmtUtils]: Spent 2.20m on a formula simplification. DAG size of input: 174 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:56:06,099 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:56:20,369 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:56:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:56:20,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142256921] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:56:20,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:56:20,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 49 [2022-12-13 14:56:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601983673] [2022-12-13 14:56:20,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:56:20,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 14:56:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:56:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 14:56:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1911, Unknown=14, NotChecked=364, Total=2450 [2022-12-13 14:56:20,464 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 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:56:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:56:25,065 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-12-13 14:56:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 14:56:25,065 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 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 40 [2022-12-13 14:56:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:56:25,066 INFO L225 Difference]: With dead ends: 151 [2022-12-13 14:56:25,066 INFO L226 Difference]: Without dead ends: 128 [2022-12-13 14:56:25,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 170.0s TimeCoverageRelationStatistics Valid=357, Invalid=3551, Unknown=14, NotChecked=500, Total=4422 [2022-12-13 14:56:25,067 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 89 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:56:25,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 465 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1352 Invalid, 2 Unknown, 268 Unchecked, 2.1s Time] [2022-12-13 14:56:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-13 14:56:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-12-13 14:56:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 127 states have internal predecessors, (142), 0 states have call successors, (0), 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:56:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2022-12-13 14:56:25,069 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 40 [2022-12-13 14:56:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:56:25,069 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2022-12-13 14:56:25,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 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:56:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2022-12-13 14:56:25,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 14:56:25,070 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:56:25,070 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:56:25,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 14:56:25,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 14:56:25,271 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:56:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:56:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash -403082130, now seen corresponding path program 1 times [2022-12-13 14:56:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:56:25,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386917541] [2022-12-13 14:56:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:56:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:56:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:56:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:56:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:56:25,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386917541] [2022-12-13 14:56:25,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386917541] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:56:25,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034330298] [2022-12-13 14:56:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:56:25,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:56:25,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:56:25,921 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:56:25,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 14:56:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:56:26,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 14:56:26,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:56:26,037 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:56:26,079 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:56:26,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:56:26,115 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:56:26,124 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 19 treesize of output 18 [2022-12-13 14:56:26,179 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:56:26,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-12-13 14:56:26,195 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-13 14:56:26,196 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-12-13 14:56:26,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:56:26,256 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 33 treesize of output 28 [2022-12-13 14:56:26,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:56:26,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 14:56:26,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:56:26,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-13 14:56:26,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:56:26,696 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 14:56:26,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-12-13 14:56:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:56:26,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:56:27,196 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 Int) (v_ArrVal_1486 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1488 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_65| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1486))) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1490))) (select (select (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| .cse1) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1488) |v_ULTIMATE.start_main_~list~0#1.offset_65|)) (+ (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_65|) 8)))) 0))) is different from false [2022-12-13 14:56:27,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:56:27,213 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 126 treesize of output 127 [2022-12-13 14:56:27,218 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 246 treesize of output 242 [2022-12-13 14:56:27,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:56:27,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:56:27,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 124 [2022-12-13 14:56:27,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:56:27,261 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 112 treesize of output 110 [2022-12-13 14:56:46,316 WARN L233 SmtUtils]: Spent 17.87s on a formula simplification. DAG size of input: 66 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:56:50,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:56:50,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:56:50,996 INFO L321 Elim1Store]: treesize reduction 55, result has 34.5 percent of original size [2022-12-13 14:56:50,996 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 567 treesize of output 133 [2022-12-13 14:56:51,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:56:51,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 102 [2022-12-13 14:56:51,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:56:51,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:56:51,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2022-12-13 14:56:51,015 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 8 treesize of output 4 [2022-12-13 14:56:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:56:51,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034330298] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:56:51,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:56:51,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-12-13 14:56:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830547714] [2022-12-13 14:56:51,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:56:51,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 14:56:51,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:56:51,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 14:56:51,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=878, Unknown=1, NotChecked=60, Total=1056 [2022-12-13 14:56:51,050 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 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:56:55,056 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 [0, 1] [2022-12-13 14:56:57,674 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 [0, 1] [2022-12-13 14:57:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:57:00,404 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-12-13 14:57:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 14:57:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 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 40 [2022-12-13 14:57:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:57:00,405 INFO L225 Difference]: With dead ends: 172 [2022-12-13 14:57:00,405 INFO L226 Difference]: Without dead ends: 172 [2022-12-13 14:57:00,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=811, Invalid=3482, Unknown=1, NotChecked=128, Total=4422 [2022-12-13 14:57:00,406 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 183 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-12-13 14:57:00,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 529 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1209 Invalid, 2 Unknown, 136 Unchecked, 6.7s Time] [2022-12-13 14:57:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-13 14:57:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2022-12-13 14:57:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 127 states have internal predecessors, (141), 0 states have call successors, (0), 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:57:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2022-12-13 14:57:00,408 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 40 [2022-12-13 14:57:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:57:00,409 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2022-12-13 14:57:00,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 33 states have internal predecessors, (100), 0 states have call successors, (0), 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:57:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-12-13 14:57:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 14:57:00,409 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:57:00,409 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:57:00,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 14:57:00,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:57:00,611 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:57:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:57:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 389355959, now seen corresponding path program 1 times [2022-12-13 14:57:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:57:00,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138342730] [2022-12-13 14:57:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:57:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:57:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:57:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:57:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:57:01,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138342730] [2022-12-13 14:57:01,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138342730] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:57:01,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703221222] [2022-12-13 14:57:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:57:01,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:57:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:57:01,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:57:01,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 14:57:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:57:01,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 14:57:01,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:57:01,337 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:57:01,377 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:57:01,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 14:57:01,425 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 21 treesize of output 20 [2022-12-13 14:57:01,440 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:57:01,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:57:01,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2022-12-13 14:57:01,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 14:57:01,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:01,581 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 21 treesize of output 20 [2022-12-13 14:57:01,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:01,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:01,599 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:57:01,600 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 36 [2022-12-13 14:57:01,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:01,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:57:02,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:02,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:02,100 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 14:57:02,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 25 [2022-12-13 14:57:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:57:02,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:57:02,680 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1628 Int) (v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1629 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_70| Int) (v_ArrVal_1624 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_70|)) (<= (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4) v_ArrVal_1624)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1628))) (select (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| .cse1) (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_70|)))) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1626) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1629) |v_ULTIMATE.start_main_~list~0#1.offset_70|) 8))) 1) |c_#StackHeapBarrier|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_70| |c_ULTIMATE.start_main_~y~0#1.offset|)))) is different from false [2022-12-13 14:57:02,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:57:02,696 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 128 treesize of output 129 [2022-12-13 14:57:02,701 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 250 treesize of output 246 [2022-12-13 14:57:02,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:02,709 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 114 treesize of output 112 [2022-12-13 14:57:02,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:02,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:57:02,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 126 [2022-12-13 14:57:16,664 WARN L233 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 70 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:57:17,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:17,370 INFO L321 Elim1Store]: treesize reduction 70, result has 29.3 percent of original size [2022-12-13 14:57:17,370 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 11100 treesize of output 2191 [2022-12-13 14:57:17,398 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:57:17,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 2603 treesize of output 2117 [2022-12-13 14:57:17,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:17,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:17,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1722 treesize of output 828 [2022-12-13 14:57:17,438 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 830 treesize of output 794 [2022-12-13 14:57:17,458 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 14:57:17,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 14:57:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:57:17,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703221222] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:57:17,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:57:17,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-12-13 14:57:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46659726] [2022-12-13 14:57:17,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:57:17,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 14:57:17,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:57:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 14:57:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=823, Unknown=3, NotChecked=58, Total=992 [2022-12-13 14:57:17,574 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:57:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:57:22,700 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2022-12-13 14:57:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 14:57:22,700 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-12-13 14:57:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:57:22,701 INFO L225 Difference]: With dead ends: 155 [2022-12-13 14:57:22,701 INFO L226 Difference]: Without dead ends: 155 [2022-12-13 14:57:22,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=628, Invalid=2913, Unknown=3, NotChecked=116, Total=3660 [2022-12-13 14:57:22,702 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 14:57:22,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 523 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1397 Invalid, 0 Unknown, 122 Unchecked, 2.6s Time] [2022-12-13 14:57:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-13 14:57:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2022-12-13 14:57:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 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:57:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-12-13 14:57:22,704 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 41 [2022-12-13 14:57:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:57:22,705 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-12-13 14:57:22,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:57:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-12-13 14:57:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 14:57:22,705 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:57:22,705 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:57:22,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 14:57:22,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 14:57:22,906 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:57:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:57:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash -814867056, now seen corresponding path program 1 times [2022-12-13 14:57:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:57:22,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967031692] [2022-12-13 14:57:22,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:57:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:57:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:57:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:57:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:57:23,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967031692] [2022-12-13 14:57:23,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967031692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:57:23,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145330210] [2022-12-13 14:57:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:57:23,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:57:23,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:57:23,563 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:57:23,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 14:57:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:57:23,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 14:57:23,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:57:23,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:57:23,710 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:57:23,773 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-12-13 14:57:23,774 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-12-13 14:57:23,834 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 29 treesize of output 24 [2022-12-13 14:57:23,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:57:23,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:23,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:23,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:57:23,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 55 [2022-12-13 14:57:23,936 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 35 treesize of output 35 [2022-12-13 14:57:24,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:24,066 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 38 treesize of output 33 [2022-12-13 14:57:24,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:24,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:24,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:24,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:24,089 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:57:24,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 61 [2022-12-13 14:57:24,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:24,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-12-13 14:57:24,631 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 14:57:24,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 14:57:24,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:24,955 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 14:57:24,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 37 [2022-12-13 14:57:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:57:24,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:57:28,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:57:28,480 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 131 treesize of output 132 [2022-12-13 14:57:28,486 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 256 treesize of output 252 [2022-12-13 14:57:28,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:28,495 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 117 treesize of output 115 [2022-12-13 14:57:28,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:28,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:57:28,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 129 [2022-12-13 14:57:34,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:34,460 INFO L321 Elim1Store]: treesize reduction 70, result has 29.3 percent of original size [2022-12-13 14:57:34,461 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1291 treesize of output 327 [2022-12-13 14:57:34,480 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-12-13 14:57:34,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 541 treesize of output 385 [2022-12-13 14:57:34,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:34,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:34,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 136 [2022-12-13 14:57:34,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:57:34,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 100 [2022-12-13 14:57:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:57:34,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145330210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:57:34,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:57:34,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2022-12-13 14:57:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524664975] [2022-12-13 14:57:34,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:57:34,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 14:57:34,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:57:34,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 14:57:34,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1322, Unknown=5, NotChecked=0, Total=1482 [2022-12-13 14:57:34,613 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 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:57:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:57:37,558 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-12-13 14:57:37,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 14:57:37,559 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 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 42 [2022-12-13 14:57:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:57:37,559 INFO L225 Difference]: With dead ends: 152 [2022-12-13 14:57:37,559 INFO L226 Difference]: Without dead ends: 152 [2022-12-13 14:57:37,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=514, Invalid=2343, Unknown=5, NotChecked=0, Total=2862 [2022-12-13 14:57:37,560 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 157 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:57:37,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 276 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 14:57:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-13 14:57:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2022-12-13 14:57:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 128 states have (on average 1.1953125) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 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:57:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-12-13 14:57:37,562 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 42 [2022-12-13 14:57:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:57:37,562 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-12-13 14:57:37,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 states have internal predecessors, (102), 0 states have call successors, (0), 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:57:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2022-12-13 14:57:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 14:57:37,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:57:37,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:57:37,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 14:57:37,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 14:57:37,765 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 14:57:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:57:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash -953430234, now seen corresponding path program 3 times [2022-12-13 14:57:37,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:57:37,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082488338] [2022-12-13 14:57:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:57:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:57:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:57:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:57:38,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:57:38,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082488338] [2022-12-13 14:57:38,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082488338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:57:38,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134239857] [2022-12-13 14:57:38,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 14:57:38,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:57:38,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:57:38,565 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:57:38,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f132ec4-7bca-41f9-9200-435fa9057064/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 14:57:38,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 14:57:38,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:57:38,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 14:57:38,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:57:38,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 14:57:38,725 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 14:57:38,725 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 14:57:38,770 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:57:38,834 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:57:38,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-13 14:57:38,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:38,871 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 31 treesize of output 26 [2022-12-13 14:57:38,990 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-12-13 14:57:38,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 41 [2022-12-13 14:57:39,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-12-13 14:57:39,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:39,151 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:57:39,151 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 45 [2022-12-13 14:57:39,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:39,251 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:57:39,252 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 45 [2022-12-13 14:57:39,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:57:39,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 14:57:39,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:57:39,992 INFO L321 Elim1Store]: treesize reduction 40, result has 28.6 percent of original size [2022-12-13 14:57:39,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 46 [2022-12-13 14:57:40,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 14:57:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:57:40,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:58:07,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:58:07,987 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 324 treesize of output 205 [2022-12-13 14:58:07,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:58:08,425 INFO L321 Elim1Store]: treesize reduction 541, result has 22.0 percent of original size [2022-12-13 14:58:08,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 355306 treesize of output 322616 [2022-12-13 14:58:09,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:58:10,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:58:10,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:58:10,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 512260 treesize of output 505264 [2022-12-13 14:58:16,647 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 1595 DAG size of output: 1590 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:59:15,288 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 250848 treesize of output 250808