./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/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_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/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_3354551f-01f9-477d-93ee-762c4e7143ba/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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- 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 20:03:04,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:03:04,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:03:04,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:03:04,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:03:04,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:03:04,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:03:04,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:03:04,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:03:04,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:03:04,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:03:04,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:03:04,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:03:04,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:03:04,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:03:04,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:03:04,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:03:04,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:03:04,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:03:04,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:03:04,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:03:04,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:03:04,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:03:04,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:03:04,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:03:04,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:03:04,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:03:04,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:03:04,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:03:04,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:03:04,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:03:04,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:03:04,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:03:04,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:03:04,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:03:04,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:03:04,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:03:04,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:03:04,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:03:04,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:03:04,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:03:04,831 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 20:03:04,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:03:04,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:03:04,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:03:04,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:03:04,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:03:04,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:03:04,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:03:04,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:03:04,871 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:03:04,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:03:04,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:03:04,871 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:03:04,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:03:04,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:03:04,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:03:04,872 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 20:03:04,872 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 20:03:04,872 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 20:03:04,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:03:04,872 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 20:03:04,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:03:04,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:03:04,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:03:04,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:03:04,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:03:04,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:03:04,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:03:04,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:03:04,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:03:04,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:03:04,873 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:03:04,874 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:03:04,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:03:04,874 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:03:04,874 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_3354551f-01f9-477d-93ee-762c4e7143ba/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_3354551f-01f9-477d-93ee-762c4e7143ba/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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-12-13 20:03:05,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:03:05,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:03:05,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:03:05,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:03:05,051 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:03:05,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-12-13 20:03:07,541 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:03:07,722 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:03:07,722 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-12-13 20:03:07,730 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/data/be555e832/6c629d7168a0426498ca36a7c7974425/FLAG88c7b7990 [2022-12-13 20:03:08,114 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/data/be555e832/6c629d7168a0426498ca36a7c7974425 [2022-12-13 20:03:08,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:03:08,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:03:08,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:03:08,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:03:08,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:03:08,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118220e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08, skipping insertion in model container [2022-12-13 20:03:08,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:03:08,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:03:08,379 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-12-13 20:03:08,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:03:08,389 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:03:08,416 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-12-13 20:03:08,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:03:08,433 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:03:08,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08 WrapperNode [2022-12-13 20:03:08,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:03:08,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:03:08,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:03:08,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:03:08,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,464 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-12-13 20:03:08,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:03:08,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:03:08,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:03:08,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:03:08,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:03:08,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:03:08,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:03:08,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:03:08,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (1/1) ... [2022-12-13 20:03:08,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:03:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:08,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:03:08,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:03:08,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:03:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:03:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 20:03:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 20:03:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 20:03:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:03:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 20:03:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 20:03:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:03:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:03:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:03:08,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:03:08,651 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:03:08,653 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:03:08,862 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:03:08,868 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:03:08,868 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 20:03:08,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:03:08 BoogieIcfgContainer [2022-12-13 20:03:08,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:03:08,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:03:08,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:03:08,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:03:08,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:03:08" (1/3) ... [2022-12-13 20:03:08,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634c7983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:03:08, skipping insertion in model container [2022-12-13 20:03:08,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:03:08" (2/3) ... [2022-12-13 20:03:08,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634c7983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:03:08, skipping insertion in model container [2022-12-13 20:03:08,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:03:08" (3/3) ... [2022-12-13 20:03:08,879 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-12-13 20:03:08,896 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:03:08,896 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-12-13 20:03:08,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:03:08,932 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;@1d74df77, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:03:08,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-12-13 20:03:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 20:03:08,940 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:08,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 20:03:08,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-12-13 20:03:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:08,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655780894] [2022-12-13 20:03:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:09,156 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 20:03:09,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:09,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655780894] [2022-12-13 20:03:09,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655780894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:09,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:09,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:03:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642140308] [2022-12-13 20:03:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:09,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:03:09,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:09,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:03:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:03:09,191 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:03:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:09,260 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-12-13 20:03:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:03:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 20:03:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:09,269 INFO L225 Difference]: With dead ends: 81 [2022-12-13 20:03:09,269 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 20:03:09,270 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 20:03:09,272 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:09,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:03:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 20:03:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-13 20:03:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-12-13 20:03:09,301 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-12-13 20:03:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:09,301 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-12-13 20:03:09,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:03:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-12-13 20:03:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 20:03:09,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:09,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 20:03:09,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:03:09,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-12-13 20:03:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:09,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194619261] [2022-12-13 20:03:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:09,386 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 20:03:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:09,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194619261] [2022-12-13 20:03:09,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194619261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:09,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:09,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:03:09,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993212346] [2022-12-13 20:03:09,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:09,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:03:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:03:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:03:09,388 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:03:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:09,420 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-12-13 20:03:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:03:09,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 20:03:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:09,422 INFO L225 Difference]: With dead ends: 76 [2022-12-13 20:03:09,422 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 20:03:09,422 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 20:03:09,423 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:09,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:03:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 20:03:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-13 20:03:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-12-13 20:03:09,431 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-12-13 20:03:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:09,431 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-12-13 20:03:09,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:03:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-12-13 20:03:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 20:03:09,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:09,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:09,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:03:09,432 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:09,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-12-13 20:03:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:09,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463758652] [2022-12-13 20:03:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:09,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:09,534 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 20:03:09,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:09,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463758652] [2022-12-13 20:03:09,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463758652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:09,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:09,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:03:09,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84624565] [2022-12-13 20:03:09,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:09,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:03:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:03:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:03:09,537 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 20:03:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:09,597 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-12-13 20:03:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:03:09,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-13 20:03:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:09,599 INFO L225 Difference]: With dead ends: 83 [2022-12-13 20:03:09,599 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 20:03:09,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:03:09,600 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:09,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:03:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 20:03:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-12-13 20:03:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-12-13 20:03:09,609 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-12-13 20:03:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:09,609 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-12-13 20:03:09,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 20:03:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-12-13 20:03:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 20:03:09,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:09,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:09,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:03:09,611 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-12-13 20:03:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:09,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200864546] [2022-12-13 20:03:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:03:09,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:09,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200864546] [2022-12-13 20:03:09,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200864546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:09,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:09,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:03:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910927502] [2022-12-13 20:03:09,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:09,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:03:09,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:03:09,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:03:09,787 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:09,925 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-12-13 20:03:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:03:09,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-13 20:03:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:09,927 INFO L225 Difference]: With dead ends: 97 [2022-12-13 20:03:09,928 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 20:03:09,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:03:09,929 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:09,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:03:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 20:03:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-12-13 20:03:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-12-13 20:03:09,935 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-12-13 20:03:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:09,936 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-12-13 20:03:09,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-12-13 20:03:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 20:03:09,937 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:09,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:09,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:03:09,937 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:09,938 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-12-13 20:03:09,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:09,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44074825] [2022-12-13 20:03:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:10,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:03:10,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44074825] [2022-12-13 20:03:10,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44074825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:10,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:10,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:03:10,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894441073] [2022-12-13 20:03:10,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:10,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:03:10,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:10,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:03:10,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:03:10,168 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:10,274 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-12-13 20:03:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:03:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-13 20:03:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:10,275 INFO L225 Difference]: With dead ends: 76 [2022-12-13 20:03:10,275 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 20:03:10,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:03:10,276 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:10,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:03:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 20:03:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-12-13 20:03:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-12-13 20:03:10,280 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-12-13 20:03:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:10,280 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-12-13 20:03:10,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-12-13 20:03:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 20:03:10,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:10,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:10,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:03:10,281 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-12-13 20:03:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:10,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500529338] [2022-12-13 20:03:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:03:10,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:10,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500529338] [2022-12-13 20:03:10,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500529338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:10,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570687460] [2022-12-13 20:03:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:10,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:10,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:10,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:10,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:03:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:10,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 20:03:10,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:10,617 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 20:03:10,661 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 20:03:10,721 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 20:03:10,721 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 20:03:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 20:03:10,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:10,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570687460] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:10,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:03:10,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-12-13 20:03:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594127689] [2022-12-13 20:03:10,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:10,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:03:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:10,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:03:10,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-12-13 20:03:10,791 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:03:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:10,937 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-12-13 20:03:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:03:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-12-13 20:03:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:10,938 INFO L225 Difference]: With dead ends: 94 [2022-12-13 20:03:10,938 INFO L226 Difference]: Without dead ends: 94 [2022-12-13 20:03:10,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-12-13 20:03:10,939 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 64 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:10,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 308 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2022-12-13 20:03:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-13 20:03:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-12-13 20:03:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-12-13 20:03:10,942 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-12-13 20:03:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:10,942 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-12-13 20:03:10,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:03:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-12-13 20:03:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 20:03:10,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:10,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:10,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:03:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 20:03:11,145 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-12-13 20:03:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:11,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775689160] [2022-12-13 20:03:11,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:11,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:11,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:11,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:03:11,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:11,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775689160] [2022-12-13 20:03:11,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775689160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:11,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342347140] [2022-12-13 20:03:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:11,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:11,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:11,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:11,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:03:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:11,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 20:03:11,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:11,665 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 20:03:11,819 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 20:03:11,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:03:11,858 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 14 treesize of output 16 [2022-12-13 20:03:11,864 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:03:11,864 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 20:03:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 20:03:11,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:12,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342347140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:12,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:03:12,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-12-13 20:03:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123983013] [2022-12-13 20:03:12,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:12,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 20:03:12,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:12,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 20:03:12,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2022-12-13 20:03:12,022 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 20:03:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:12,295 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-12-13 20:03:12,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:03:12,296 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-12-13 20:03:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:12,297 INFO L225 Difference]: With dead ends: 94 [2022-12-13 20:03:12,297 INFO L226 Difference]: Without dead ends: 94 [2022-12-13 20:03:12,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2022-12-13 20:03:12,298 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 172 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:12,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 408 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 324 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2022-12-13 20:03:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-13 20:03:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-12-13 20:03:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-12-13 20:03:12,301 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2022-12-13 20:03:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:12,302 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-12-13 20:03:12,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 20:03:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-12-13 20:03:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 20:03:12,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:12,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:12,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:03:12,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 20:03:12,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-12-13 20:03:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:12,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153327708] [2022-12-13 20:03:12,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:12,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:12,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:03:12,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:12,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153327708] [2022-12-13 20:03:12,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153327708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:12,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:12,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:03:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669423442] [2022-12-13 20:03:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:12,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:03:12,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:12,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:03:12,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:03:12,774 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:13,024 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-12-13 20:03:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:03:13,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 20:03:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:13,025 INFO L225 Difference]: With dead ends: 142 [2022-12-13 20:03:13,026 INFO L226 Difference]: Without dead ends: 142 [2022-12-13 20:03:13,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:03:13,027 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:13,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:03:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-12-13 20:03:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2022-12-13 20:03:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-12-13 20:03:13,032 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2022-12-13 20:03:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:13,032 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-12-13 20:03:13,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-12-13 20:03:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 20:03:13,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:13,033 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:13,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:03:13,033 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-12-13 20:03:13,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:13,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328066806] [2022-12-13 20:03:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:13,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:13,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:03:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:13,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328066806] [2022-12-13 20:03:13,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328066806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:13,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10173620] [2022-12-13 20:03:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:13,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:13,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:13,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:03:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:13,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 20:03:13,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:03:13,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:03:13,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10173620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:13,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:03:13,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 20:03:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993867267] [2022-12-13 20:03:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:13,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:03:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:03:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:03:13,260 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:13,300 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-12-13 20:03:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:03:13,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 20:03:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:13,301 INFO L225 Difference]: With dead ends: 104 [2022-12-13 20:03:13,301 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 20:03:13,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:03:13,302 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 122 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:13,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 216 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:03:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 20:03:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-12-13 20:03:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-12-13 20:03:13,306 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 30 [2022-12-13 20:03:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:13,307 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-12-13 20:03:13,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-12-13 20:03:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 20:03:13,307 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:13,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:13,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:03:13,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:13,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2022-12-13 20:03:13,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:13,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664644617] [2022-12-13 20:03:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:13,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:03:13,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:13,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664644617] [2022-12-13 20:03:13,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664644617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:13,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:13,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:03:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374374822] [2022-12-13 20:03:13,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:13,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:03:13,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:03:13,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:03:13,723 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:13,970 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-12-13 20:03:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:03:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 20:03:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:13,971 INFO L225 Difference]: With dead ends: 127 [2022-12-13 20:03:13,971 INFO L226 Difference]: Without dead ends: 127 [2022-12-13 20:03:13,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:03:13,972 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 307 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:13,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:03:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-13 20:03:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2022-12-13 20:03:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-12-13 20:03:13,977 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2022-12-13 20:03:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:13,977 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-12-13 20:03:13,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-12-13 20:03:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 20:03:13,978 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:13,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:13,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:03:13,979 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-12-13 20:03:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:13,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639192677] [2022-12-13 20:03:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:03:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:14,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639192677] [2022-12-13 20:03:14,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639192677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:14,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855653154] [2022-12-13 20:03:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:14,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:14,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:14,312 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:14,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:03:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:14,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 20:03:14,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:14,402 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 20:03:14,452 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:03:14,452 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 20:03:14,463 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 20:03:14,483 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:03:14,483 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 20:03:14,574 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 25 treesize of output 13 [2022-12-13 20:03:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:03:14,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:14,602 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-12-13 20:03:14,603 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 19 treesize of output 18 [2022-12-13 20:03:14,649 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-12-13 20:03:14,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:14,655 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 20:03:14,658 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 30 treesize of output 22 [2022-12-13 20:03:14,661 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 5 treesize of output 3 [2022-12-13 20:03:14,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855653154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:14,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:03:14,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2022-12-13 20:03:14,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472765973] [2022-12-13 20:03:14,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:14,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 20:03:14,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:14,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 20:03:14,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=588, Unknown=8, NotChecked=48, Total=702 [2022-12-13 20:03:14,723 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:15,373 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-12-13 20:03:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 20:03:15,373 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-12-13 20:03:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:15,374 INFO L225 Difference]: With dead ends: 125 [2022-12-13 20:03:15,374 INFO L226 Difference]: Without dead ends: 125 [2022-12-13 20:03:15,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=1090, Unknown=9, NotChecked=68, Total=1332 [2022-12-13 20:03:15,375 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 173 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:15,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 896 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 20:03:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-13 20:03:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2022-12-13 20:03:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 20:03:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2022-12-13 20:03:15,379 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2022-12-13 20:03:15,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:15,379 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2022-12-13 20:03:15,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-12-13 20:03:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 20:03:15,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:15,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:15,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 20:03:15,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:15,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2022-12-13 20:03:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:15,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201944527] [2022-12-13 20:03:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:16,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:03:16,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201944527] [2022-12-13 20:03:16,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201944527] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749872339] [2022-12-13 20:03:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:16,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:16,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:16,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:16,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:03:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:16,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 20:03:16,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:16,346 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 20:03:16,551 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:03:16,551 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 20:03:16,557 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 16 treesize of output 11 [2022-12-13 20:03:16,624 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 20:03:16,628 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 20:03:16,730 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:03:16,730 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 44 treesize of output 43 [2022-12-13 20:03:16,734 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 33 [2022-12-13 20:03:16,894 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 31 treesize of output 19 [2022-12-13 20:03:16,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2022-12-13 20:03:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:03:16,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:17,204 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-12-13 20:03:17,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:17,339 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 20:03:17,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:17,343 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 20:03:17,346 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 52 treesize of output 44 [2022-12-13 20:03:17,348 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 82 treesize of output 70 [2022-12-13 20:03:17,352 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 34 treesize of output 30 [2022-12-13 20:03:17,354 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 62 treesize of output 58 [2022-12-13 20:03:17,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:17,375 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 20 treesize of output 21 [2022-12-13 20:03:17,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:03:17,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 [2022-12-13 20:03:21,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749872339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:21,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:03:21,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-12-13 20:03:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707796425] [2022-12-13 20:03:21,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:21,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 20:03:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 20:03:21,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2007, Unknown=26, NotChecked=90, Total=2256 [2022-12-13 20:03:21,602 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 20:03:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:22,729 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-12-13 20:03:22,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 20:03:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-12-13 20:03:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:22,730 INFO L225 Difference]: With dead ends: 150 [2022-12-13 20:03:22,730 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 20:03:22,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=272, Invalid=2785, Unknown=27, NotChecked=108, Total=3192 [2022-12-13 20:03:22,731 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 240 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:22,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1402 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 20:03:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 20:03:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-12-13 20:03:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 20:03:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-12-13 20:03:22,735 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 33 [2022-12-13 20:03:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:22,735 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-12-13 20:03:22,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 20:03:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-12-13 20:03:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 20:03:22,736 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:22,736 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 20:03:22,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 20:03:22,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 20:03:22,938 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2022-12-13 20:03:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:22,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635796921] [2022-12-13 20:03:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:03:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:23,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635796921] [2022-12-13 20:03:23,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635796921] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:23,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442297229] [2022-12-13 20:03:23,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:03:23,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:23,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:23,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:23,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 20:03:23,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:03:23,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:03:23,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:03:23,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:03:23,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:03:23,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442297229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:23,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:03:23,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-12-13 20:03:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237205488] [2022-12-13 20:03:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:23,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:03:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:03:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:03:23,240 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:23,268 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-12-13 20:03:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:03:23,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-12-13 20:03:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:23,269 INFO L225 Difference]: With dead ends: 89 [2022-12-13 20:03:23,269 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 20:03:23,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:03:23,270 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 217 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:23,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 115 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:03:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 20:03:23,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-12-13 20:03:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 20:03:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-12-13 20:03:23,272 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 36 [2022-12-13 20:03:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:23,272 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-12-13 20:03:23,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-12-13 20:03:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 20:03:23,273 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:23,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:23,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 20:03:23,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 20:03:23,474 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2022-12-13 20:03:23,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:23,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195034463] [2022-12-13 20:03:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 20:03:23,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:23,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195034463] [2022-12-13 20:03:23,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195034463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:23,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:23,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:03:23,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626069281] [2022-12-13 20:03:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:23,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:03:23,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:23,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:03:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:03:23,604 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:23,793 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-12-13 20:03:23,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:03:23,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-12-13 20:03:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:23,794 INFO L225 Difference]: With dead ends: 114 [2022-12-13 20:03:23,794 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 20:03:23,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:03:23,795 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 280 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:23,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:03:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 20:03:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2022-12-13 20:03:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 20:03:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-12-13 20:03:23,797 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 40 [2022-12-13 20:03:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:23,798 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-12-13 20:03:23,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-12-13 20:03:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 20:03:23,799 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:23,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:23,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:03:23,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2022-12-13 20:03:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:23,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985083281] [2022-12-13 20:03:23,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:03:23,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:23,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985083281] [2022-12-13 20:03:23,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985083281] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:23,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88043203] [2022-12-13 20:03:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:23,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:23,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 20:03:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:24,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 20:03:24,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 20:03:24,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 20:03:24,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88043203] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:03:24,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:03:24,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-12-13 20:03:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766289599] [2022-12-13 20:03:24,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:24,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:03:24,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:24,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:03:24,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:03:24,069 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:03:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:24,149 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-12-13 20:03:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:03:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-12-13 20:03:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:24,150 INFO L225 Difference]: With dead ends: 120 [2022-12-13 20:03:24,150 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 20:03:24,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:03:24,150 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 139 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:24,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 250 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:03:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 20:03:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2022-12-13 20:03:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 20:03:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2022-12-13 20:03:24,153 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 40 [2022-12-13 20:03:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:24,153 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2022-12-13 20:03:24,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:03:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2022-12-13 20:03:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 20:03:24,154 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:24,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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 20:03:24,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 20:03:24,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 20:03:24,354 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:24,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2022-12-13 20:03:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:24,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182197934] [2022-12-13 20:03:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:03:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:24,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182197934] [2022-12-13 20:03:24,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182197934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:24,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217385634] [2022-12-13 20:03:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:24,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:24,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:24,466 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:24,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 20:03:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:24,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:03:24,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 20:03:24,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 20:03:24,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217385634] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:03:24,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:03:24,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-12-13 20:03:24,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048777457] [2022-12-13 20:03:24,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:24,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:03:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:03:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:03:24,645 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:03:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:24,730 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-12-13 20:03:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:03:24,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-12-13 20:03:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:24,731 INFO L225 Difference]: With dead ends: 114 [2022-12-13 20:03:24,731 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 20:03:24,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:03:24,731 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 202 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:24,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 265 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:03:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 20:03:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2022-12-13 20:03:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 20:03:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-12-13 20:03:24,735 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 41 [2022-12-13 20:03:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:24,735 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-12-13 20:03:24,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:03:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-12-13 20:03:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 20:03:24,736 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:24,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:24,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 20:03:24,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:24,938 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:24,938 INFO L85 PathProgramCache]: Analyzing trace with hash -192932373, now seen corresponding path program 3 times [2022-12-13 20:03:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:24,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079741406] [2022-12-13 20:03:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 20:03:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 20:03:25,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:25,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079741406] [2022-12-13 20:03:25,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079741406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:25,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377899233] [2022-12-13 20:03:25,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:03:25,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:25,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:25,069 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:25,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 20:03:25,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 20:03:25,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:03:25,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 20:03:25,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:03:25,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:03:25,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377899233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:25,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:03:25,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 20:03:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927441434] [2022-12-13 20:03:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:25,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:03:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:25,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:03:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:03:25,216 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:03:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:25,223 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-12-13 20:03:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:03:25,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-12-13 20:03:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:25,224 INFO L225 Difference]: With dead ends: 92 [2022-12-13 20:03:25,224 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 20:03:25,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:03:25,225 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:25,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:03:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 20:03:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-12-13 20:03:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2022-12-13 20:03:25,227 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 45 [2022-12-13 20:03:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:25,227 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2022-12-13 20:03:25,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:03:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-12-13 20:03:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 20:03:25,227 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:25,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2022-12-13 20:03:25,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 20:03:25,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 20:03:25,429 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2022-12-13 20:03:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:25,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657842237] [2022-12-13 20:03:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 20:03:25,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:25,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657842237] [2022-12-13 20:03:25,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657842237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:25,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:03:25,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:03:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635358652] [2022-12-13 20:03:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:25,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:03:25,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:25,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:03:25,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:03:25,677 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:25,851 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-12-13 20:03:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:03:25,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-12-13 20:03:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:25,852 INFO L225 Difference]: With dead ends: 132 [2022-12-13 20:03:25,852 INFO L226 Difference]: Without dead ends: 132 [2022-12-13 20:03:25,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:03:25,852 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 409 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:25,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 294 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:03:25,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-13 20:03:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2022-12-13 20:03:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-12-13 20:03:25,855 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 45 [2022-12-13 20:03:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:25,855 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-12-13 20:03:25,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-12-13 20:03:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 20:03:25,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:25,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2022-12-13 20:03:25,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 20:03:25,856 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:25,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2022-12-13 20:03:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:25,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244096046] [2022-12-13 20:03:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:03:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:25,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244096046] [2022-12-13 20:03:25,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244096046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:25,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689037533] [2022-12-13 20:03:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:25,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:25,961 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:25,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 20:03:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:26,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:03:26,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 20:03:26,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:03:26,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689037533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:26,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:03:26,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-12-13 20:03:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215295101] [2022-12-13 20:03:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:26,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:03:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:03:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:03:26,119 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:26,142 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-12-13 20:03:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:03:26,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-12-13 20:03:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:26,142 INFO L225 Difference]: With dead ends: 88 [2022-12-13 20:03:26,143 INFO L226 Difference]: Without dead ends: 88 [2022-12-13 20:03:26,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:03:26,143 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 167 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:26,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 117 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:03:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-12-13 20:03:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-12-13 20:03:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-12-13 20:03:26,146 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 48 [2022-12-13 20:03:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:26,146 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-12-13 20:03:26,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-12-13 20:03:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 20:03:26,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:26,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2022-12-13 20:03:26,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 20:03:26,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:26,348 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2022-12-13 20:03:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:26,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758015741] [2022-12-13 20:03:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:26,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:03:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:26,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758015741] [2022-12-13 20:03:26,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758015741] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937144714] [2022-12-13 20:03:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:26,991 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:26,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 20:03:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:27,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 20:03:27,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:27,119 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 20:03:27,181 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:03:27,182 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 20:03:27,231 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 20:03:27,285 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:03:27,285 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 20:03:27,476 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:03:27,476 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 20:03:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:03:27,533 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 20:03:27,578 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 25 treesize of output 13 [2022-12-13 20:03:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 20:03:27,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:31,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-12-13 20:03:31,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-12-13 20:03:31,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-12-13 20:03:31,427 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) is different from false [2022-12-13 20:03:31,435 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-12-13 20:03:31,435 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 29 treesize of output 28 [2022-12-13 20:03:31,439 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-12-13 20:03:31,446 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-12-13 20:03:31,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:31,452 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 36 treesize of output 29 [2022-12-13 20:03:31,454 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 136 treesize of output 112 [2022-12-13 20:03:31,457 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 108 treesize of output 98 [2022-12-13 20:03:31,460 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 98 treesize of output 94 [2022-12-13 20:03:31,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937144714] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:31,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:03:31,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2022-12-13 20:03:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492506431] [2022-12-13 20:03:31,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:31,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 20:03:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 20:03:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1738, Unknown=36, NotChecked=534, Total=2450 [2022-12-13 20:03:31,541 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:03:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:32,544 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-12-13 20:03:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 20:03:32,544 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-12-13 20:03:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:32,544 INFO L225 Difference]: With dead ends: 145 [2022-12-13 20:03:32,544 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 20:03:32,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=368, Invalid=3160, Unknown=36, NotChecked=726, Total=4290 [2022-12-13 20:03:32,545 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 555 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:32,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1091 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 20:03:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 20:03:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2022-12-13 20:03:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-12-13 20:03:32,547 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 48 [2022-12-13 20:03:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:32,548 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-12-13 20:03:32,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:03:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-12-13 20:03:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 20:03:32,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:32,548 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2022-12-13 20:03:32,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 20:03:32,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:32,749 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2022-12-13 20:03:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:32,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324340689] [2022-12-13 20:03:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:03:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:33,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324340689] [2022-12-13 20:03:33,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324340689] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:33,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36985790] [2022-12-13 20:03:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:33,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:33,794 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:33,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 20:03:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:33,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-13 20:03:33,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:33,934 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 20:03:34,234 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:03:34,235 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 20:03:34,238 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 14 treesize of output 16 [2022-12-13 20:03:34,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:03:34,316 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 20:03:34,415 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:03:34,415 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 44 treesize of output 43 [2022-12-13 20:03:34,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-12-13 20:03:34,715 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:03:34,716 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 44 treesize of output 43 [2022-12-13 20:03:34,720 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 33 [2022-12-13 20:03:34,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:03:34,796 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 32 [2022-12-13 20:03:34,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:03:34,801 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 36 treesize of output 31 [2022-12-13 20:03:34,879 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 31 treesize of output 19 [2022-12-13 20:03:34,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2022-12-13 20:03:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 20:03:34,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:35,508 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1897 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-12-13 20:03:35,650 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1897 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-12-13 20:03:35,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_1897 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))))) is different from false [2022-12-13 20:03:35,819 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1897 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-12-13 20:03:35,831 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2022-12-13 20:03:35,850 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-12-13 20:03:35,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:35,859 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 38 treesize of output 39 [2022-12-13 20:03:35,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:35,864 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 30 treesize of output 31 [2022-12-13 20:03:35,867 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 54 treesize of output 46 [2022-12-13 20:03:35,871 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 220 treesize of output 204 [2022-12-13 20:03:35,877 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 200 treesize of output 194 [2022-12-13 20:03:35,880 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 194 treesize of output 182 [2022-12-13 20:03:35,884 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 126 treesize of output 114 [2022-12-13 20:03:35,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:35,938 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 73 treesize of output 74 [2022-12-13 20:03:35,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:35,945 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 65 treesize of output 50 [2022-12-13 20:03:35,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:03:35,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-12-13 20:03:35,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:03:35,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:03:35,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-12-13 20:03:44,189 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:03:44,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36985790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:44,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:03:44,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2022-12-13 20:03:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942245303] [2022-12-13 20:03:44,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:44,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-13 20:03:44,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:44,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-13 20:03:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3057, Unknown=74, NotChecked=702, Total=4032 [2022-12-13 20:03:44,192 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 20:03:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:45,756 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-12-13 20:03:45,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 20:03:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-12-13 20:03:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:45,757 INFO L225 Difference]: With dead ends: 124 [2022-12-13 20:03:45,757 INFO L226 Difference]: Without dead ends: 124 [2022-12-13 20:03:45,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=420, Invalid=4640, Unknown=76, NotChecked=870, Total=6006 [2022-12-13 20:03:45,759 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 659 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:45,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2115 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 20:03:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-13 20:03:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2022-12-13 20:03:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-12-13 20:03:45,764 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 48 [2022-12-13 20:03:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:45,764 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-12-13 20:03:45,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 20:03:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-12-13 20:03:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 20:03:45,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:45,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:45,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 20:03:45,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:45,966 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash -74907051, now seen corresponding path program 1 times [2022-12-13 20:03:45,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:45,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256125266] [2022-12-13 20:03:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:03:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:46,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256125266] [2022-12-13 20:03:46,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256125266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:46,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176845998] [2022-12-13 20:03:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:46,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:46,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:46,116 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:46,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 20:03:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:46,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 20:03:46,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 20:03:46,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:03:46,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176845998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:03:46,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:03:46,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 20:03:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886043787] [2022-12-13 20:03:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:03:46,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:03:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:03:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:03:46,304 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:03:46,340 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-12-13 20:03:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:03:46,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-12-13 20:03:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:03:46,342 INFO L225 Difference]: With dead ends: 86 [2022-12-13 20:03:46,342 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 20:03:46,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:03:46,342 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 74 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:03:46,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 191 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:03:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 20:03:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-12-13 20:03:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:03:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-12-13 20:03:46,345 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 49 [2022-12-13 20:03:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:03:46,345 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-12-13 20:03:46,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:03:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-12-13 20:03:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 20:03:46,346 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:03:46,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:03:46,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 20:03:46,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 20:03:46,547 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:03:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:03:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash 836425368, now seen corresponding path program 1 times [2022-12-13 20:03:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:03:46,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059238201] [2022-12-13 20:03:46,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:03:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:03:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:47,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:03:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:03:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:03:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059238201] [2022-12-13 20:03:47,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059238201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:03:47,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287649666] [2022-12-13 20:03:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:03:47,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:03:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:03:47,939 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:03:47,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 20:03:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:03:48,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 111 conjunts are in the unsatisfiable core [2022-12-13 20:03:48,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:03:48,109 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 20:03:48,273 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:03:48,273 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 20:03:48,339 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 20:03:48,343 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 20:03:48,418 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:03:48,419 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 29 treesize of output 30 [2022-12-13 20:03:48,421 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 10 treesize of output 9 [2022-12-13 20:03:48,677 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:03:48,677 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 55 [2022-12-13 20:03:48,681 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 29 treesize of output 21 [2022-12-13 20:03:48,683 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 32 treesize of output 34 [2022-12-13 20:03:48,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:03:48,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-12-13 20:03:48,835 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 28 treesize of output 30 [2022-12-13 20:03:48,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:03:48,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 35 treesize of output 34 [2022-12-13 20:03:48,975 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 33 treesize of output 21 [2022-12-13 20:03:48,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 13 [2022-12-13 20:03:49,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 20:03:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:03:49,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:03:49,439 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_2182)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_2181)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_2182)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_2181)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) .cse0)))) is different from false [2022-12-13 20:03:49,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:49,842 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 50 treesize of output 51 [2022-12-13 20:03:49,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:49,851 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 104 treesize of output 103 [2022-12-13 20:03:49,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 39 treesize of output 23 [2022-12-13 20:03:49,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:49,903 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 50 treesize of output 51 [2022-12-13 20:03:49,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:49,913 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 104 treesize of output 103 [2022-12-13 20:03:49,920 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 39 treesize of output 23 [2022-12-13 20:03:49,960 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-12-13 20:03:51,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-12-13 20:03:53,531 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2022-12-13 20:03:53,539 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2181 Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-12-13 20:03:53,554 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2181 Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-12-13 20:03:53,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:53,563 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 56 treesize of output 49 [2022-12-13 20:03:53,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:03:53,568 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 40 treesize of output 41 [2022-12-13 20:03:53,571 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 66 [2022-12-13 20:03:53,575 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 566 treesize of output 530 [2022-12-13 20:03:53,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:03:53,581 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 470 treesize of output 446 [2022-12-13 20:03:53,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:03:53,586 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 392 treesize of output 368 [2022-12-13 20:03:53,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:03:53,595 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 237 treesize of output 219 [2022-12-13 20:03:53,603 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 52 treesize of output 50 [2022-12-13 20:03:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-13 20:03:54,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287649666] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:03:54,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:03:54,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 29] total 81 [2022-12-13 20:03:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206574625] [2022-12-13 20:03:54,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:03:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-12-13 20:03:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:03:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-12-13 20:03:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=5203, Unknown=98, NotChecked=906, Total=6480 [2022-12-13 20:03:54,079 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 81 states, 79 states have (on average 1.6455696202531647) internal successors, (130), 72 states have internal predecessors, (130), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:04:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:02,667 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-12-13 20:04:02,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 20:04:02,668 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 79 states have (on average 1.6455696202531647) internal successors, (130), 72 states have internal predecessors, (130), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-12-13 20:04:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:02,669 INFO L225 Difference]: With dead ends: 84 [2022-12-13 20:04:02,669 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 20:04:02,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=728, Invalid=8897, Unknown=101, NotChecked=1194, Total=10920 [2022-12-13 20:04:02,671 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 429 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 497 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:02,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1467 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1630 Invalid, 0 Unknown, 497 Unchecked, 1.2s Time] [2022-12-13 20:04:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 20:04:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-12-13 20:04:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-12-13 20:04:02,673 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2022-12-13 20:04:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:02,673 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-12-13 20:04:02,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 79 states have (on average 1.6455696202531647) internal successors, (130), 72 states have internal predecessors, (130), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:04:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-12-13 20:04:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 20:04:02,673 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:02,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:02,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 20:04:02,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 20:04:02,875 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:02,876 INFO L85 PathProgramCache]: Analyzing trace with hash -368684005, now seen corresponding path program 1 times [2022-12-13 20:04:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:02,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509799245] [2022-12-13 20:04:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:03,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:04:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:03,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509799245] [2022-12-13 20:04:03,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509799245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:03,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145924510] [2022-12-13 20:04:03,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:03,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:03,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:04:03,616 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:04:03,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 20:04:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:03,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 20:04:03,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:04:03,883 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 17 treesize of output 13 [2022-12-13 20:04:04,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 19 treesize of output 7 [2022-12-13 20:04:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 20:04:04,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:04:04,311 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 38 treesize of output 32 [2022-12-13 20:04:04,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:04:04,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:04:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 20:04:04,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145924510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:04:04,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:04:04,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 39 [2022-12-13 20:04:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498787240] [2022-12-13 20:04:04,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:04:04,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 20:04:04,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:04,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 20:04:04,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1368, Unknown=0, NotChecked=0, Total=1482 [2022-12-13 20:04:04,448 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 20:04:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:05,324 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-12-13 20:04:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 20:04:05,325 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-12-13 20:04:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:05,325 INFO L225 Difference]: With dead ends: 118 [2022-12-13 20:04:05,325 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 20:04:05,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=2301, Unknown=0, NotChecked=0, Total=2652 [2022-12-13 20:04:05,326 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 889 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:05,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1024 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 20:04:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 20:04:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2022-12-13 20:04:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-12-13 20:04:05,328 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 59 [2022-12-13 20:04:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:05,328 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-12-13 20:04:05,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 20:04:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-12-13 20:04:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 20:04:05,329 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:05,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-12-13 20:04:05,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 20:04:05,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:05,530 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2070538002, now seen corresponding path program 2 times [2022-12-13 20:04:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:05,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976229936] [2022-12-13 20:04:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:05,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 20:04:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:05,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976229936] [2022-12-13 20:04:05,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976229936] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:05,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849947557] [2022-12-13 20:04:05,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:04:05,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:05,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:04:05,676 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:04:05,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 20:04:05,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:04:05,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:04:05,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:04:05,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:04:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 20:04:05,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:04:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 20:04:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849947557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:04:05,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:04:05,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-12-13 20:04:05,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388507233] [2022-12-13 20:04:05,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:04:05,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:04:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:05,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:04:05,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:04:05,933 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:04:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:06,013 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-12-13 20:04:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:04:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-12-13 20:04:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:06,014 INFO L225 Difference]: With dead ends: 79 [2022-12-13 20:04:06,014 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 20:04:06,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-13 20:04:06,014 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 118 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:06,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 244 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:04:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 20:04:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-12-13 20:04:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-12-13 20:04:06,016 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 62 [2022-12-13 20:04:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:06,016 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-12-13 20:04:06,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:04:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-12-13 20:04:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 20:04:06,017 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:06,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:06,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 20:04:06,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 20:04:06,218 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 424234897, now seen corresponding path program 1 times [2022-12-13 20:04:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:06,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666933948] [2022-12-13 20:04:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:06,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 20:04:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:06,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666933948] [2022-12-13 20:04:06,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666933948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:04:06,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:04:06,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:04:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884880569] [2022-12-13 20:04:06,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:04:06,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:04:06,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:04:06,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:04:06,392 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:04:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:06,543 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-12-13 20:04:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:04:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-12-13 20:04:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:06,544 INFO L225 Difference]: With dead ends: 97 [2022-12-13 20:04:06,544 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 20:04:06,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:04:06,545 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:06,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 258 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:04:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 20:04:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2022-12-13 20:04:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-12-13 20:04:06,548 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 63 [2022-12-13 20:04:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:06,548 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-12-13 20:04:06,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:04:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-12-13 20:04:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 20:04:06,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:06,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:06,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 20:04:06,549 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:06,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:06,549 INFO L85 PathProgramCache]: Analyzing trace with hash 424234898, now seen corresponding path program 1 times [2022-12-13 20:04:06,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:06,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46539663] [2022-12-13 20:04:06,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:06,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 20:04:06,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:06,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46539663] [2022-12-13 20:04:06,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46539663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:04:06,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:04:06,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:04:06,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308158860] [2022-12-13 20:04:06,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:04:06,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:04:06,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:04:06,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:04:06,747 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:04:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:06,908 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-12-13 20:04:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:04:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-12-13 20:04:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:06,908 INFO L225 Difference]: With dead ends: 80 [2022-12-13 20:04:06,908 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 20:04:06,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:04:06,909 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 191 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:06,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 201 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:04:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 20:04:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-13 20:04:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-12-13 20:04:06,911 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 63 [2022-12-13 20:04:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:06,911 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-12-13 20:04:06,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:04:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-12-13 20:04:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 20:04:06,911 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:06,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:06,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 20:04:06,912 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 266413795, now seen corresponding path program 1 times [2022-12-13 20:04:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094087962] [2022-12-13 20:04:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:06,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 20:04:07,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:07,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094087962] [2022-12-13 20:04:07,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094087962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:04:07,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:04:07,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 20:04:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860287429] [2022-12-13 20:04:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:04:07,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:04:07,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:04:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:04:07,019 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:04:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:07,119 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-12-13 20:04:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:04:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2022-12-13 20:04:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:07,121 INFO L225 Difference]: With dead ends: 80 [2022-12-13 20:04:07,121 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 20:04:07,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:04:07,121 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 187 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:07,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 257 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:04:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 20:04:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-13 20:04:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.173913043478261) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-12-13 20:04:07,123 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 64 [2022-12-13 20:04:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:07,123 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-12-13 20:04:07,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:04:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-12-13 20:04:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 20:04:07,123 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:07,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:07,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 20:04:07,124 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854879, now seen corresponding path program 1 times [2022-12-13 20:04:07,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:07,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457157626] [2022-12-13 20:04:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:07,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 20:04:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457157626] [2022-12-13 20:04:07,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457157626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327857470] [2022-12-13 20:04:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:04:07,258 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:04:07,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 20:04:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:07,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 20:04:07,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:04:07,617 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 17 treesize of output 9 [2022-12-13 20:04:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 20:04:07,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:04:07,697 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 20:04:07,697 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 16 treesize of output 15 [2022-12-13 20:04:07,739 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 20:04:07,739 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 11 treesize of output 11 [2022-12-13 20:04:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 20:04:07,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327857470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:04:07,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:04:07,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2022-12-13 20:04:07,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964158640] [2022-12-13 20:04:07,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:04:07,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 20:04:07,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:07,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 20:04:07,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-12-13 20:04:07,780 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 20:04:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:08,141 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-12-13 20:04:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 20:04:08,142 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2022-12-13 20:04:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:08,142 INFO L225 Difference]: With dead ends: 88 [2022-12-13 20:04:08,142 INFO L226 Difference]: Without dead ends: 88 [2022-12-13 20:04:08,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 20:04:08,143 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 354 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:08,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 513 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:04:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-12-13 20:04:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-12-13 20:04:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-12-13 20:04:08,144 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 66 [2022-12-13 20:04:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-12-13 20:04:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 20:04:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-12-13 20:04:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 20:04:08,145 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:08,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:08,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 20:04:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 20:04:08,346 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854878, now seen corresponding path program 1 times [2022-12-13 20:04:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:08,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344462601] [2022-12-13 20:04:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 20:04:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:09,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344462601] [2022-12-13 20:04:09,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344462601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:09,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776833140] [2022-12-13 20:04:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:09,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:09,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:04:09,217 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:04:09,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 20:04:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:09,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 109 conjunts are in the unsatisfiable core [2022-12-13 20:04:09,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:04:09,378 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 20:04:09,501 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:04:09,501 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 20:04:09,558 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 20:04:09,561 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 20:04:09,637 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:04:09,637 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 29 treesize of output 30 [2022-12-13 20:04:09,639 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 20:04:09,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 20:04:09,846 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 20:04:09,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:04:09,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 20:04:10,271 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 23 treesize of output 15 [2022-12-13 20:04:10,274 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 26 treesize of output 14 [2022-12-13 20:04:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:04:10,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:04:10,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:10,542 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 32 treesize of output 36 [2022-12-13 20:04:10,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:10,685 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 28 treesize of output 32 [2022-12-13 20:04:11,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:11,401 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 36 treesize of output 37 [2022-12-13 20:04:11,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:11,405 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 28 treesize of output 29 [2022-12-13 20:04:11,408 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 50 treesize of output 42 [2022-12-13 20:04:11,412 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 258 treesize of output 238 [2022-12-13 20:04:11,416 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 234 treesize of output 226 [2022-12-13 20:04:11,419 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 226 treesize of output 210 [2022-12-13 20:04:11,424 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 110 treesize of output 98 [2022-12-13 20:04:11,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776833140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:11,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:04:11,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 51 [2022-12-13 20:04:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647368019] [2022-12-13 20:04:11,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:04:11,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 20:04:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 20:04:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4827, Unknown=9, NotChecked=0, Total=5112 [2022-12-13 20:04:11,679 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:04:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:13,153 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-12-13 20:04:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 20:04:13,153 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-12-13 20:04:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:13,154 INFO L225 Difference]: With dead ends: 89 [2022-12-13 20:04:13,154 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 20:04:13,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=668, Invalid=7513, Unknown=9, NotChecked=0, Total=8190 [2022-12-13 20:04:13,155 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 496 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:13,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 985 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 20:04:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 20:04:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2022-12-13 20:04:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-12-13 20:04:13,157 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 66 [2022-12-13 20:04:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:13,157 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-12-13 20:04:13,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:04:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-12-13 20:04:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 20:04:13,157 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:13,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:13,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 20:04:13,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:13,358 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:13,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1372895080, now seen corresponding path program 1 times [2022-12-13 20:04:13,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:13,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150505290] [2022-12-13 20:04:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:13,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 20:04:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:13,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150505290] [2022-12-13 20:04:13,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150505290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:04:13,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:04:13,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:04:13,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948539169] [2022-12-13 20:04:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:04:13,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:04:13,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:13,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:04:13,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:04:13,533 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:04:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:13,670 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-12-13 20:04:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:04:13,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-12-13 20:04:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:13,671 INFO L225 Difference]: With dead ends: 81 [2022-12-13 20:04:13,671 INFO L226 Difference]: Without dead ends: 81 [2022-12-13 20:04:13,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:04:13,672 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 172 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:13,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 222 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:04:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-13 20:04:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-13 20:04:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.125) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-12-13 20:04:13,673 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 67 [2022-12-13 20:04:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:13,673 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-12-13 20:04:13,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:04:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-12-13 20:04:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 20:04:13,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:13,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:13,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 20:04:13,674 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash -795789539, now seen corresponding path program 1 times [2022-12-13 20:04:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:13,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826405793] [2022-12-13 20:04:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:14,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:14,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:04:14,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:14,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826405793] [2022-12-13 20:04:14,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826405793] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:14,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551133787] [2022-12-13 20:04:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:14,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:14,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:04:14,390 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:04:14,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 20:04:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:14,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-13 20:04:14,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:04:14,569 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 20:04:14,630 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 5 treesize of output 3 [2022-12-13 20:04:14,680 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:04:14,680 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 20:04:14,695 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 20:04:14,761 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:04:14,761 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 20:04:14,950 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:04:14,950 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 20:04:15,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:04:15,038 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 20:04:15,196 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 25 treesize of output 13 [2022-12-13 20:04:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:04:15,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:04:15,517 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3183 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 20:04:15,525 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3183 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 20:04:15,530 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3183 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 20:04:15,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3183 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 20:04:15,544 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3183 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 20:04:15,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3182 (Array Int Int)) (v_ArrVal_3183 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3183)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 20:04:15,639 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3182 (Array Int Int)) (v_ArrVal_3183 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3183)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-12-13 20:04:15,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:15,646 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 38 treesize of output 31 [2022-12-13 20:04:15,648 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 252 treesize of output 216 [2022-12-13 20:04:15,652 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 212 treesize of output 204 [2022-12-13 20:04:15,655 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 204 treesize of output 188 [2022-12-13 20:04:15,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551133787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:15,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:04:15,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 33 [2022-12-13 20:04:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438276829] [2022-12-13 20:04:15,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:04:15,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 20:04:15,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 20:04:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1436, Unknown=12, NotChecked=574, Total=2162 [2022-12-13 20:04:15,844 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:16,851 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-12-13 20:04:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 20:04:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2022-12-13 20:04:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:16,852 INFO L225 Difference]: With dead ends: 86 [2022-12-13 20:04:16,852 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 20:04:16,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 91 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=303, Invalid=2469, Unknown=12, NotChecked=756, Total=3540 [2022-12-13 20:04:16,852 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 155 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:16,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 614 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 20:04:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 20:04:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-12-13 20:04:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-12-13 20:04:16,854 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 69 [2022-12-13 20:04:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:16,854 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-12-13 20:04:16,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-12-13 20:04:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 20:04:16,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:16,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:16,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 20:04:17,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:17,056 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:17,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:17,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1056399479, now seen corresponding path program 1 times [2022-12-13 20:04:17,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:17,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470041378] [2022-12-13 20:04:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:17,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:17,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 20:04:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:17,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470041378] [2022-12-13 20:04:17,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470041378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:17,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460557051] [2022-12-13 20:04:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:17,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:17,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:04:17,688 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:04:17,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 20:04:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:17,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-13 20:04:17,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:04:17,901 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 20:04:17,969 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:04:17,970 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 20:04:18,017 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 20:04:18,079 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:04:18,080 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 19 treesize of output 22 [2022-12-13 20:04:18,198 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:04:18,198 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 19 treesize of output 22 [2022-12-13 20:04:18,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-12-13 20:04:18,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:18,308 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 16 treesize of output 16 [2022-12-13 20:04:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:04:18,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:04:18,756 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-12-13 20:04:21,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:21,206 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 42 treesize of output 35 [2022-12-13 20:04:21,208 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 285 treesize of output 267 [2022-12-13 20:04:21,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:21,218 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 293 treesize of output 283 [2022-12-13 20:04:21,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:04:21,230 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 296 treesize of output 289 [2022-12-13 20:04:21,235 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 332 treesize of output 324 [2022-12-13 20:04:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2022-12-13 20:04:21,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460557051] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:04:21,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:04:21,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 58 [2022-12-13 20:04:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664965778] [2022-12-13 20:04:21,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:04:21,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-13 20:04:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:04:21,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-13 20:04:21,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2887, Unknown=108, NotChecked=110, Total=3306 [2022-12-13 20:04:21,705 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-13 20:04:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:04:22,894 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-12-13 20:04:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 20:04:22,894 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2022-12-13 20:04:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:04:22,894 INFO L225 Difference]: With dead ends: 80 [2022-12-13 20:04:22,894 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 20:04:22,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=409, Invalid=4457, Unknown=108, NotChecked=138, Total=5112 [2022-12-13 20:04:22,895 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 180 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:04:22,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 867 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 997 Invalid, 0 Unknown, 67 Unchecked, 0.6s Time] [2022-12-13 20:04:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 20:04:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-12-13 20:04:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:04:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-12-13 20:04:22,897 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 70 [2022-12-13 20:04:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:04:22,897 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-12-13 20:04:22,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-13 20:04:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-12-13 20:04:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 20:04:22,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:04:22,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:04:22,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 20:04:23,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 20:04:23,098 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-12-13 20:04:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:04:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 853476134, now seen corresponding path program 1 times [2022-12-13 20:04:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:04:23,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190090628] [2022-12-13 20:04:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:04:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:04:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:24,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:04:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:04:24,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:04:24,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190090628] [2022-12-13 20:04:24,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190090628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:04:24,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768005825] [2022-12-13 20:04:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:04:24,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:04:24,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:04:24,323 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:04:24,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3354551f-01f9-477d-93ee-762c4e7143ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 20:04:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:04:24,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 118 conjunts are in the unsatisfiable core [2022-12-13 20:04:24,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:04:24,510 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 20:04:24,660 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 20:04:24,660 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 20:04:24,765 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 20:04:24,773 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 20:04:24,904 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 20:04:24,904 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 47 treesize of output 33 [2022-12-13 20:04:24,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 20:04:25,124 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 20:04:25,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:04:25,274 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 20:04:25,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 42 [2022-12-13 20:04:25,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:04:25,436 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 20:04:25,436 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 42 treesize of output 39 [2022-12-13 20:04:25,946 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-12-13 20:04:25,947 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 43 treesize of output 30 [2022-12-13 20:04:26,196 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 20:04:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 20:04:26,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:06:30,377 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:08:53,243 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3469 (Array Int Int)) (v_ArrVal_3474 Int) (v_ArrVal_3475 Int) (v_ArrVal_3472 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse1 (store .cse3 .cse4 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3472)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3474))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3469) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select (store |c_#valid| .cse0 v_ArrVal_3475) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) 1)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3469 (Array Int Int)) (v_ArrVal_3474 Int) (v_ArrVal_3475 Int) (v_ArrVal_3472 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3469) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (let ((.cse7 (store .cse3 .cse4 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3472)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3474))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (select (store |c_#valid| .cse6 v_ArrVal_3475) (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse8) .cse6) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))) 1))))))) is different from false [2022-12-13 20:08:56,848 INFO L321 Elim1Store]: treesize reduction 947, result has 38.2 percent of original size [2022-12-13 20:08:56,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 11 new quantified variables, introduced 26 case distinctions, treesize of input 94627 treesize of output 43596 [2022-12-13 20:08:57,953 INFO L321 Elim1Store]: treesize reduction 1367, result has 20.2 percent of original size [2022-12-13 20:08:57,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 54476 treesize of output 51206 [2022-12-13 20:09:55,731 WARN L233 SmtUtils]: Spent 52.55s on a formula simplification. DAG size of input: 805 DAG size of output: 205 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 20:09:55,732 INFO L321 Elim1Store]: treesize reduction 6548, result has 8.7 percent of original size [2022-12-13 20:09:55,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 19 new quantified variables, introduced 120 case distinctions, treesize of input 7328806483987546 treesize of output 6764479673109938