./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R --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 b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- 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-38b53e6 [2022-11-25 16:57:15,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:57:15,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:57:15,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:57:15,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:57:15,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:57:15,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:57:15,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:57:15,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:57:15,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:57:15,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:57:15,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:57:15,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:57:15,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:57:15,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:57:15,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:57:15,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:57:15,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:57:15,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:57:15,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:57:15,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:57:15,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:57:15,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:57:15,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:57:15,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:57:15,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:57:15,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:57:15,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:57:15,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:57:15,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:57:15,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:57:15,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:57:15,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:57:15,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:57:15,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:57:15,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:57:15,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:57:15,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:57:15,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:57:15,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:57:15,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:57:15,228 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 16:57:15,251 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:57:15,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:57:15,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:57:15,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:57:15,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:57:15,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:57:15,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:57:15,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:57:15,254 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:57:15,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:57:15,255 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:57:15,255 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:57:15,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:57:15,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:57:15,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:57:15,256 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:57:15,256 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:57:15,256 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:57:15,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:57:15,257 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:57:15,257 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:57:15,257 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:57:15,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:57:15,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:57:15,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:57:15,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:57:15,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:57:15,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:57:15,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:57:15,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:57:15,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:57:15,260 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:57:15,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:57:15,260 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_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/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_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2022-11-25 16:57:15,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:57:15,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:57:15,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:57:15,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:57:15,561 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:57:15,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-25 16:57:18,690 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:57:19,092 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:57:19,093 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-25 16:57:19,104 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/data/8a22cfebd/0b87439b30c24b6684446d2b8a490028/FLAGba958acdf [2022-11-25 16:57:19,123 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/data/8a22cfebd/0b87439b30c24b6684446d2b8a490028 [2022-11-25 16:57:19,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:57:19,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:57:19,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:57:19,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:57:19,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:57:19,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ad295d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19, skipping insertion in model container [2022-11-25 16:57:19,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:57:19,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:57:19,535 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_d74a1fef-6169-4be4-8c53-709f8847c4c4/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-25 16:57:19,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:57:19,547 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:57:19,586 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_d74a1fef-6169-4be4-8c53-709f8847c4c4/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-25 16:57:19,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:57:19,614 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:57:19,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19 WrapperNode [2022-11-25 16:57:19,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:57:19,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:57:19,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:57:19,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:57:19,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,671 INFO L138 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-11-25 16:57:19,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:57:19,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:57:19,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:57:19,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:57:19,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,703 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:57:19,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:57:19,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:57:19,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:57:19,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (1/1) ... [2022-11-25 16:57:19,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:57:19,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:19,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:19,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:57:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-25 16:57:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-25 16:57:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:57:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 16:57:19,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:57:19,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:57:19,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 16:57:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 16:57:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:57:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 16:57:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:57:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:57:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:57:19,918 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:57:19,920 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:57:19,962 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-25 16:57:20,319 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:57:20,326 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:57:20,332 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 16:57:20,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:20 BoogieIcfgContainer [2022-11-25 16:57:20,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:57:20,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:57:20,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:57:20,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:57:20,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:57:19" (1/3) ... [2022-11-25 16:57:20,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e3860b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:57:20, skipping insertion in model container [2022-11-25 16:57:20,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:19" (2/3) ... [2022-11-25 16:57:20,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e3860b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:57:20, skipping insertion in model container [2022-11-25 16:57:20,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:20" (3/3) ... [2022-11-25 16:57:20,351 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2022-11-25 16:57:20,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:57:20,379 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-25 16:57:20,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:57:20,458 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;@307d1da2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:57:20,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-25 16:57:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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-11-25 16:57:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 16:57:20,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:20,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 16:57:20,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-25 16:57:20,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:20,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717194714] [2022-11-25 16:57:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:20,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:20,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717194714] [2022-11-25 16:57:20,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717194714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:20,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:20,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:57:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959614873] [2022-11-25 16:57:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:20,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:20,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:20,875 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:21,043 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-11-25 16:57:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:21,049 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 16:57:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:21,060 INFO L225 Difference]: With dead ends: 86 [2022-11-25 16:57:21,061 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 16:57:21,063 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-11-25 16:57:21,072 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:21,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:57:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 16:57:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2022-11-25 16:57:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-11-25 16:57:21,112 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 5 [2022-11-25 16:57:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:21,112 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-11-25 16:57:21,113 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-11-25 16:57:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 16:57:21,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:21,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 16:57:21,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:57:21,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-25 16:57:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:21,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756210504] [2022-11-25 16:57:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:21,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:21,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756210504] [2022-11-25 16:57:21,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756210504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:21,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:21,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:57:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307256437] [2022-11-25 16:57:21,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:21,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:21,238 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:21,322 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-11-25 16:57:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:21,322 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 16:57:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:21,323 INFO L225 Difference]: With dead ends: 85 [2022-11-25 16:57:21,324 INFO L226 Difference]: Without dead ends: 85 [2022-11-25 16:57:21,324 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-11-25 16:57:21,329 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:21,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:57:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-25 16:57:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2022-11-25 16:57:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-25 16:57:21,336 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 5 [2022-11-25 16:57:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:21,337 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-25 16:57:21,337 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-25 16:57:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 16:57:21,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:21,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:21,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:57:21,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:21,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113076, now seen corresponding path program 1 times [2022-11-25 16:57:21,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:21,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615403759] [2022-11-25 16:57:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:21,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615403759] [2022-11-25 16:57:21,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615403759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:21,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:21,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:57:21,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180914281] [2022-11-25 16:57:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:21,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:21,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:21,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:21,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:21,427 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:21,449 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-25 16:57:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 16:57:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:21,454 INFO L225 Difference]: With dead ends: 58 [2022-11-25 16:57:21,454 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 16:57:21,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:21,456 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:21,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:57:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 16:57:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2022-11-25 16:57:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-25 16:57:21,470 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 7 [2022-11-25 16:57:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:21,471 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-25 16:57:21,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-25 16:57:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 16:57:21,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:21,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:21,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:57:21,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-25 16:57:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:21,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842520501] [2022-11-25 16:57:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:21,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842520501] [2022-11-25 16:57:21,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842520501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:21,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:21,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:57:21,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361017852] [2022-11-25 16:57:21,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:21,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:21,687 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:21,709 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-11-25 16:57:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:21,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 16:57:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:21,711 INFO L225 Difference]: With dead ends: 55 [2022-11-25 16:57:21,711 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 16:57:21,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:21,713 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:21,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:57:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 16:57:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-11-25 16:57:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-25 16:57:21,719 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 9 [2022-11-25 16:57:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:21,720 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-25 16:57:21,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-25 16:57:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 16:57:21,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:21,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:21,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:57:21,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash -763066877, now seen corresponding path program 1 times [2022-11-25 16:57:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:21,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115283233] [2022-11-25 16:57:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:21,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115283233] [2022-11-25 16:57:21,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115283233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:21,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245253322] [2022-11-25 16:57:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:21,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:21,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:21,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:57:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:22,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:57:22,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:22,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:22,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245253322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:22,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:57:22,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 16:57:22,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829902596] [2022-11-25 16:57:22,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:22,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:57:22,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:22,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:57:22,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:57:22,206 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:22,225 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-11-25 16:57:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:57:22,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 16:57:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:22,227 INFO L225 Difference]: With dead ends: 56 [2022-11-25 16:57:22,227 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 16:57:22,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:57:22,228 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:22,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 134 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:57:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 16:57:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 16:57:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-11-25 16:57:22,235 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 14 [2022-11-25 16:57:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:22,235 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-11-25 16:57:22,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-11-25 16:57:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:57:22,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:22,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:22,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:22,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:22,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-25 16:57:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:22,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011085714] [2022-11-25 16:57:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:22,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:22,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011085714] [2022-11-25 16:57:22,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011085714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189235905] [2022-11-25 16:57:22,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:22,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:22,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:22,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:57:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:22,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 16:57:22,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:22,890 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-11-25 16:57:22,957 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 16:57:22,957 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-11-25 16:57:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:22,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:23,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189235905] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:23,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:57:23,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-25 16:57:23,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638396170] [2022-11-25 16:57:23,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:23,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:57:23,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:23,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:57:23,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:57:23,179 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:23,408 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-25 16:57:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:57:23,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 16:57:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:23,410 INFO L225 Difference]: With dead ends: 82 [2022-11-25 16:57:23,411 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 16:57:23,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:57:23,412 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:23,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 123 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:57:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 16:57:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2022-11-25 16:57:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-25 16:57:23,418 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 16 [2022-11-25 16:57:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:23,418 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-25 16:57:23,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-25 16:57:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:57:23,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:23,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:23,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:23,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 16:57:23,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-25 16:57:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:23,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604328564] [2022-11-25 16:57:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:23,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604328564] [2022-11-25 16:57:23,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604328564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137936366] [2022-11-25 16:57:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:23,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:23,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:23,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:23,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:57:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:23,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:57:23,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:23,995 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-11-25 16:57:24,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:57:24,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:57:24,094 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:57:24,095 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-11-25 16:57:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:24,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:30,442 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 50 treesize of output 46 [2022-11-25 16:57:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:30,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137936366] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:30,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:57:30,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-25 16:57:30,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586302735] [2022-11-25 16:57:30,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:30,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 16:57:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:30,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 16:57:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:57:30,581 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:30,845 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-25 16:57:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:57:30,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 16:57:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:30,846 INFO L225 Difference]: With dead ends: 81 [2022-11-25 16:57:30,846 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 16:57:30,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:57:30,848 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 317 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:30,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 73 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:57:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 16:57:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2022-11-25 16:57:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-25 16:57:30,861 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 16 [2022-11-25 16:57:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:30,862 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-25 16:57:30,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-25 16:57:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 16:57:30,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:30,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:30,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 16:57:31,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:31,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:31,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957292, now seen corresponding path program 2 times [2022-11-25 16:57:31,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:31,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816481392] [2022-11-25 16:57:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:31,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816481392] [2022-11-25 16:57:31,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816481392] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500064097] [2022-11-25 16:57:31,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:31,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:31,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:31,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:57:31,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 16:57:31,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:31,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:57:31,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 16:57:31,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:31,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500064097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:31,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:57:31,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 16:57:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308674819] [2022-11-25 16:57:31,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:31,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:57:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:57:31,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:57:31,308 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:31,330 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-25 16:57:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:57:31,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 16:57:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:31,333 INFO L225 Difference]: With dead ends: 80 [2022-11-25 16:57:31,333 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 16:57:31,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:57:31,335 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 91 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 91 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-11-25 16:57:31,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 91 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:57:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 16:57:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2022-11-25 16:57:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-25 16:57:31,354 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 21 [2022-11-25 16:57:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:31,355 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-25 16:57:31,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-25 16:57:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 16:57:31,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:31,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:31,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:31,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:31,567 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2022-11-25 16:57:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676150556] [2022-11-25 16:57:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:31,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676150556] [2022-11-25 16:57:31,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676150556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:31,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410701066] [2022-11-25 16:57:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:31,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:31,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:31,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:31,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 16:57:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:31,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:57:31,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:31,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:31,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410701066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:31,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:57:31,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-25 16:57:31,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928627239] [2022-11-25 16:57:31,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:31,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:57:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:57:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:57:31,846 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:31,881 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-11-25 16:57:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:57:31,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 16:57:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:31,882 INFO L225 Difference]: With dead ends: 55 [2022-11-25 16:57:31,883 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 16:57:31,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:57:31,887 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 81 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:31,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:57:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 16:57:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 16:57:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-25 16:57:31,901 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 21 [2022-11-25 16:57:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:31,902 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-25 16:57:31,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-25 16:57:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 16:57:31,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:31,914 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:31,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 16:57:32,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 16:57:32,120 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2022-11-25 16:57:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:32,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848198527] [2022-11-25 16:57:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:57:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848198527] [2022-11-25 16:57:32,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848198527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510593602] [2022-11-25 16:57:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:32,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:32,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:32,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:32,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 16:57:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:32,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:57:32,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:32,586 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-11-25 16:57:32,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:57:32,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:57:32,641 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:57:32,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:57:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 16:57:32,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 16:57:32,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510593602] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:32,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:57:32,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-11-25 16:57:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316334703] [2022-11-25 16:57:32,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:32,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:57:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:32,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:57:32,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:57:32,761 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:32,892 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-25 16:57:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:57:32,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 16:57:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:32,893 INFO L225 Difference]: With dead ends: 72 [2022-11-25 16:57:32,893 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 16:57:32,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:57:32,894 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 146 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:32,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 77 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:57:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 16:57:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-11-25 16:57:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-25 16:57:32,897 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 22 [2022-11-25 16:57:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:32,898 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-25 16:57:32,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-25 16:57:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 16:57:32,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:32,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:32,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:33,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 16:57:33,099 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:33,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2022-11-25 16:57:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:33,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136009897] [2022-11-25 16:57:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:33,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136009897] [2022-11-25 16:57:33,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136009897] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:33,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238330531] [2022-11-25 16:57:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:33,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:33,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:33,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:33,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:57:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:33,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 16:57:33,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:33,728 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-11-25 16:57:33,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:57:33,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:57:33,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:57:33,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:57:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:57:33,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:57:34,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238330531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:34,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:57:34,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-11-25 16:57:34,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941652975] [2022-11-25 16:57:34,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:34,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:57:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:57:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:57:34,284 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:34,443 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-25 16:57:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:57:34,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 16:57:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:34,444 INFO L225 Difference]: With dead ends: 66 [2022-11-25 16:57:34,444 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 16:57:34,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:57:34,445 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 174 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:34,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 35 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:57:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 16:57:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-11-25 16:57:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.358974358974359) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-11-25 16:57:34,447 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 22 [2022-11-25 16:57:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:34,448 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-11-25 16:57:34,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-11-25 16:57:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 16:57:34,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:34,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:34,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:34,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:34,649 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:34,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2022-11-25 16:57:34,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:34,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14708457] [2022-11-25 16:57:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:34,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:57:34,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:34,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14708457] [2022-11-25 16:57:34,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14708457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:34,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:34,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:57:34,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705424683] [2022-11-25 16:57:34,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:34,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:57:34,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:34,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:57:34,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:57:34,828 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:35,061 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-25 16:57:35,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:57:35,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 16:57:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:35,062 INFO L225 Difference]: With dead ends: 72 [2022-11-25 16:57:35,062 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 16:57:35,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:57:35,063 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 112 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:35,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 119 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:57:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 16:57:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2022-11-25 16:57:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.375) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-25 16:57:35,065 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2022-11-25 16:57:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:35,065 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-25 16:57:35,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-25 16:57:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 16:57:35,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:35,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:35,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:57:35,067 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2022-11-25 16:57:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:35,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873987403] [2022-11-25 16:57:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:57:35,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873987403] [2022-11-25 16:57:35,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873987403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:35,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:35,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:57:35,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287967896] [2022-11-25 16:57:35,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:35,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:57:35,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:35,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:57:35,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:57:35,328 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:35,573 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-25 16:57:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:57:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 16:57:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:35,574 INFO L225 Difference]: With dead ends: 66 [2022-11-25 16:57:35,575 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 16:57:35,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:57:35,575 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 190 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:35,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 89 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:57:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 16:57:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-11-25 16:57:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-11-25 16:57:35,577 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 23 [2022-11-25 16:57:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:35,578 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-11-25 16:57:35,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-11-25 16:57:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 16:57:35,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:35,578 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] [2022-11-25 16:57:35,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:57:35,579 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116430, now seen corresponding path program 1 times [2022-11-25 16:57:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:35,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086114829] [2022-11-25 16:57:35,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:35,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086114829] [2022-11-25 16:57:36,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086114829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848971600] [2022-11-25 16:57:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:36,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:36,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 16:57:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:36,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-25 16:57:36,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:36,524 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-11-25 16:57:36,599 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:57:36,599 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-11-25 16:57:36,639 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 13 treesize of output 9 [2022-11-25 16:57:36,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:57:36,703 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:57:36,704 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 34 treesize of output 35 [2022-11-25 16:57:36,926 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 49 treesize of output 37 [2022-11-25 16:57:36,989 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-25 16:57:36,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 16:57:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:37,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:37,115 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 28 treesize of output 20 [2022-11-25 16:57:37,307 INFO L321 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-25 16:57:37,307 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 28 treesize of output 27 [2022-11-25 16:57:37,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)))))) is different from false [2022-11-25 16:57:37,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:37,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2022-11-25 16:57:37,547 INFO L321 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-11-25 16:57:37,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-11-25 16:57:37,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:37,564 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 108 treesize of output 104 [2022-11-25 16:57:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 16:57:37,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848971600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:37,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:57:37,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2022-11-25 16:57:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417474539] [2022-11-25 16:57:37,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:37,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 16:57:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 16:57:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1085, Unknown=6, NotChecked=66, Total=1260 [2022-11-25 16:57:37,782 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:39,561 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-25 16:57:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 16:57:39,561 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 16:57:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:57:39,563 INFO L225 Difference]: With dead ends: 84 [2022-11-25 16:57:39,563 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 16:57:39,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=390, Invalid=1960, Unknown=6, NotChecked=94, Total=2450 [2022-11-25 16:57:39,565 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 332 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:57:39,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 309 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 655 Invalid, 0 Unknown, 66 Unchecked, 0.5s Time] [2022-11-25 16:57:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 16:57:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2022-11-25 16:57:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.372093023255814) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-11-25 16:57:39,568 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 26 [2022-11-25 16:57:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:57:39,568 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-11-25 16:57:39,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-11-25 16:57:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 16:57:39,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:57:39,569 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] [2022-11-25 16:57:39,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:39,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 16:57:39,770 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:57:39,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116431, now seen corresponding path program 1 times [2022-11-25 16:57:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:39,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546266172] [2022-11-25 16:57:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:40,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:40,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546266172] [2022-11-25 16:57:40,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546266172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:57:40,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293433595] [2022-11-25 16:57:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:40,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:40,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:40,710 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:40,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 16:57:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:40,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 16:57:40,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:40,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:57:41,030 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:57:41,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 16:57:41,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:57:41,105 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 13 treesize of output 9 [2022-11-25 16:57:41,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:57:41,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:57:41,288 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:57:41,289 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 73 treesize of output 68 [2022-11-25 16:57:41,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-25 16:57:41,850 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 16:57:41,850 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 161 treesize of output 74 [2022-11-25 16:57:41,884 INFO L321 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-11-25 16:57:41,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 45 [2022-11-25 16:57:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:42,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:43,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:43,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 329 [2022-11-25 16:57:44,420 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse5 (select (select .cse3 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse1 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse5 4))) (or (= (select (select .cse0 .cse1) .cse2) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (< (select (select .cse3 .cse1) .cse2) .cse4))))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse7 (select (select .cse8 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse8 .cse7) (+ .cse9 4)))) (or (= .cse6 0) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7))))))) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse10 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse12 (select (select .cse17 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse15 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ 4 .cse12))) (let ((.cse11 (select (select .cse17 .cse13) .cse16))) (or (< .cse11 .cse4) (= .cse11 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse12)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13)) (= (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse14 (select (select .cse14 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse15 .cse13) .cse16)))))))) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse22 (select (select .cse21 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse19 (select (select .cse18 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (+ .cse22 4))) (or (= (select (select .cse18 .cse19) .cse20) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse19)) (< (select (select .cse21 .cse19) .cse20) .cse4) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse23 (select (select .cse23 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2)) (.cse27 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (+ 4 .cse27)) (.cse25 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse24 .cse25) .cse26) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (= (select (select .cse28 .cse25) .cse26) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse25)))))))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse30 (select (select .cse33 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select (select .cse33 .cse30) (+ .cse31 4)))) (or (= .cse29 0) (= .cse29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse30)) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse29 (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse32 (select (select .cse32 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse34 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse35 (select (select .cse40 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (+ 4 .cse39))) (let ((.cse38 (select (select .cse40 .cse35) .cse36))) (or (= (select (select .cse34 .cse35) .cse36) 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse37 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse38)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse39)) (= .cse38 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse35)))))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse43 (select (select .cse41 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse41 .cse42) (+ .cse43 4)) 8)) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse42 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (select (select .cse47 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse44 (select (select .cse47 .cse46) (+ 4 .cse45)))) (or (< .cse44 .cse4) (= .cse44 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse45)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse48 (select (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse53 (select (select .cse53 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse48 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse50 (select (select .cse51 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse49 (select (select .cse51 .cse50) (+ .cse52 4)))) (or (= .cse49 0) (= .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse50)) (= .cse49 .cse48)))))) (not (= .cse52 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse58 (select (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse61 (select (select .cse61 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse60 (select (select .cse56 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse55 (select (select .cse59 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (+ .cse60 4))) (let ((.cse54 (select (select .cse59 .cse55) .cse57))) (or (= .cse54 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse55)) (< (select (select .cse56 .cse55) .cse57) .cse4) (= .cse54 .cse58)))))) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse67 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse64 (select (select .cse63 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (+ 4 .cse67))) (let ((.cse62 (select (select .cse66 .cse64) .cse65))) (or (< .cse62 .cse4) (= .cse62 0) (= (select (select .cse63 .cse64) .cse65) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse67)))))))) is different from false [2022-11-25 16:57:47,257 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse70 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse70 0))) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse70 0)))) (and (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse8 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse1 (select (select .cse3 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select (select .cse9 .cse1) .cse4))) (or (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse0 .cse2) (= (select (select .cse3 .cse1) .cse4) (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse5 (select (select .cse5 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse10 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse10 (select (select .cse10 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse15 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse12 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse15 4))) (or (= (select (select .cse11 .cse12) .cse13) 0) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse14 .cse12) .cse13) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse18 (select (let ((.cse21 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse21 (select (select .cse21 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse20 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse19 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse17 (select (select .cse19 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse19 .cse17) (+ .cse20 4)))) (or (= .cse16 0) (= .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse18 .cse16)))))) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse26 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse24 (select (select .cse26 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (select (select .cse26 .cse24) (+ .cse23 4)))) (or (= .cse22 0) (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse25 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse25 (select (select .cse25 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse22)))))) (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse30 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse31 (select (select .cse30 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse27 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse29 (+ .cse31 4)) (.cse28 (select (select .cse27 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse27 .cse28) .cse29) 0) (< (select (select .cse30 .cse28) .cse29) .cse2) (not (= .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse32 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse35 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse34 (select (select .cse35 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (select (select .cse35 .cse34) (+ .cse32 4)))) (or (= .cse33 0) (= .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse36 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse36 (select (select .cse36 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse37 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse41 (select (select .cse40 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (+ .cse41 4)) (.cse38 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse37 .cse38) .cse39) 0) (< (select (select .cse40 .cse38) .cse39) .cse2) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse46 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse47 (select (select .cse46 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse44 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (+ .cse47 4))) (let ((.cse42 (select (select .cse46 .cse43) .cse45))) (or (= .cse42 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse42 .cse2) (= (select (select .cse44 .cse43) .cse45) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse48 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse50 (select (select .cse48 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse48 .cse49) (+ .cse50 4)) 8)) (not (= .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse51 (select (let ((.cse58 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse58 (select (select .cse58 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse53 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse57 (select (select .cse53 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse56 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse54 (select (select .cse56 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse55 (+ .cse57 4))) (let ((.cse52 (select (select .cse56 .cse54) .cse55))) (or (= .cse52 0) (< (select (select .cse53 .cse54) .cse55) .cse2) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse51 .cse52)))))) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse59 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse64 (select (select .cse59 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse60 (select (select .cse65 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (+ .cse64 4))) (let ((.cse62 (select (select .cse65 .cse60) .cse61))) (or (= (select (select .cse59 .cse60) .cse61) 0) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse62 (select (let ((.cse63 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse63 (select (select .cse63 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse62 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse69 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse67 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (select (select .cse69 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse66 (select (select .cse69 .cse67) (+ .cse68 4)))) (or (= .cse66 0) (not (= .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse66 .cse2) (not (= .cse68 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))) is different from false [2022-11-25 16:57:47,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:47,405 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 2 case distinctions, treesize of input 171 treesize of output 131 [2022-11-25 16:57:47,827 INFO L321 Elim1Store]: treesize reduction 232, result has 36.8 percent of original size [2022-11-25 16:57:47,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 533 treesize of output 547 [2022-11-25 16:57:47,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:47,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 401 treesize of output 260 [2022-11-25 16:57:48,264 INFO L321 Elim1Store]: treesize reduction 200, result has 43.2 percent of original size [2022-11-25 16:57:48,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1547 treesize of output 1496 [2022-11-25 16:57:48,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:48,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1215 treesize of output 1131 [2022-11-25 16:57:48,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:48,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1318 treesize of output 1194 [2022-11-25 16:57:48,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:48,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 473 treesize of output 467 [2022-11-25 16:57:55,040 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:55,040 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 2 case distinctions, treesize of input 310 treesize of output 1 [2022-11-25 16:57:55,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:55,056 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 2 case distinctions, treesize of input 100 treesize of output 90 [2022-11-25 16:57:55,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:55,068 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 2 case distinctions, treesize of input 85 treesize of output 60 [2022-11-25 16:57:55,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:57:55,221 INFO L321 Elim1Store]: treesize reduction 127, result has 43.6 percent of original size [2022-11-25 16:57:55,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 196 treesize of output 229 [2022-11-25 16:57:55,382 INFO L321 Elim1Store]: treesize reduction 4, result has 96.1 percent of original size [2022-11-25 16:57:55,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 155 [2022-11-25 16:57:55,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-25 16:57:55,414 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 161 treesize of output 137 [2022-11-25 16:57:57,282 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:57,283 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 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-25 16:57:57,298 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:57,299 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 2 case distinctions, treesize of input 465 treesize of output 1 [2022-11-25 16:57:57,311 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:57,311 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 2 case distinctions, treesize of input 171 treesize of output 1 [2022-11-25 16:57:57,325 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:57,325 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 2 case distinctions, treesize of input 240 treesize of output 1 [2022-11-25 16:57:57,338 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:57,339 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 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-25 16:57:57,352 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:57,353 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 2 case distinctions, treesize of input 381 treesize of output 1 [2022-11-25 16:57:57,365 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:57,366 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 2 case distinctions, treesize of input 379 treesize of output 1 [2022-11-25 16:57:57,377 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 16:57:57,377 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 2 case distinctions, treesize of input 242 treesize of output 1 [2022-11-25 16:57:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 16:57:57,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293433595] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:57,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:57:57,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 42 [2022-11-25 16:57:57,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092188124] [2022-11-25 16:57:57,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:57,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 16:57:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:57,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 16:57:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1521, Unknown=2, NotChecked=158, Total=1806 [2022-11-25 16:57:57,636 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:01,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse58 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse52 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse79 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse51 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse80 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse38 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse78 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select .cse38 .cse78)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse51 .cse80 0))) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse79 .cse80 0))) (.cse54 (select .cse79 .cse52)) (.cse39 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse53 (select .cse58 .cse78))) (and (not (= .cse0 0)) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse9 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse2 (select (select .cse4 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse9 4))) (let ((.cse1 (select (select .cse10 .cse2) .cse5))) (or (= .cse1 0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse1 .cse3) (= (select (select .cse4 .cse2) .cse5) (select (let ((.cse6 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse6 (select (select .cse6 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse11 (select (select .cse11 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse12 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse16 (select (select .cse12 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse15 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ .cse16 4))) (or (= (select (select .cse12 .cse13) .cse14) 0) (not (= .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse15 .cse13) .cse14) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse19 (select (let ((.cse22 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse22 (select (select .cse22 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse21 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse20 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse18 (select (select .cse20 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select .cse20 .cse18) (+ .cse21 4)))) (or (= .cse17 0) (= .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse19 .cse17)))))) (not (= .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse27 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse25 (select (select .cse27 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (select (select .cse27 .cse25) (+ .cse24 4)))) (or (= .cse23 0) (= .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse26 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse26 (select (select .cse26 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse23)))))) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse31 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse32 (select (select .cse31 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse28 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse30 (+ .cse32 4)) (.cse29 (select (select .cse28 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse28 .cse29) .cse30) 0) (< (select (select .cse31 .cse29) .cse30) .cse3) (not (= .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse33 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse36 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse35 (select (select .cse36 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse36 .cse35) (+ .cse33 4)))) (or (= .cse34 0) (= .cse34 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse37 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse37 (select (select .cse37 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse38 .cse39) 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse43 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse44 (select (select .cse43 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (+ .cse44 4)) (.cse41 (select (select .cse40 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse40 .cse41) .cse42) 0) (< (select (select .cse43 .cse41) .cse42) .cse3) (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse49 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse50 (select (select .cse49 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse47 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse46 (select (select .cse47 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse48 (+ .cse50 4))) (let ((.cse45 (select (select .cse49 .cse46) .cse48))) (or (= .cse45 0) (not (= .cse46 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse45 .cse3) (= (select (select .cse47 .cse46) .cse48) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= (select .cse51 .cse52) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= (+ .cse53 12) (select |c_#length| .cse0)) (= .cse54 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse55 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse57 (select (select .cse55 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse55 .cse56) (+ .cse57 4)) 8)) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= (select |c_#length| (select .cse38 4)) 12) (= (select .cse58 4) 0) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse59 (select (let ((.cse66 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse66 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse59 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse61 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse65 (select (select .cse61 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse64 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse62 (select (select .cse64 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (+ .cse65 4))) (let ((.cse60 (select (select .cse64 .cse62) .cse63))) (or (= .cse60 0) (< (select (select .cse61 .cse62) .cse63) .cse3) (not (= .cse62 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse59 .cse60)))))) (not (= .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse67 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse72 (select (select .cse67 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse73 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse68 (select (select .cse73 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (+ .cse72 4))) (let ((.cse70 (select (select .cse73 .cse68) .cse69))) (or (= (select (select .cse67 .cse68) .cse69) 0) (not (= .cse68 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse70 (select (let ((.cse71 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse71 (select (select .cse71 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse70 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse77 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse75 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse76 (select (select .cse77 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse74 (select (select .cse77 .cse75) (+ .cse76 4)))) (or (= .cse74 0) (not (= .cse75 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse74 .cse3) (not (= .cse76 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse54) (= (select .cse58 .cse39) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= .cse53 0)))) is different from false [2022-11-25 16:58:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:08,275 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2022-11-25 16:58:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 16:58:08,283 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 16:58:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:08,285 INFO L225 Difference]: With dead ends: 154 [2022-11-25 16:58:08,286 INFO L226 Difference]: Without dead ends: 154 [2022-11-25 16:58:08,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=674, Invalid=4003, Unknown=27, NotChecked=408, Total=5112 [2022-11-25 16:58:08,290 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 930 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:08,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 589 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 713 Invalid, 0 Unknown, 208 Unchecked, 1.3s Time] [2022-11-25 16:58:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-25 16:58:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 55. [2022-11-25 16:58:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-25 16:58:08,293 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 26 [2022-11-25 16:58:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:08,294 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-25 16:58:08,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-25 16:58:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 16:58:08,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:08,296 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] [2022-11-25 16:58:08,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:08,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 16:58:08,502 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:08,503 INFO L85 PathProgramCache]: Analyzing trace with hash 687445232, now seen corresponding path program 1 times [2022-11-25 16:58:08,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:08,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399438328] [2022-11-25 16:58:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:08,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:58:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:08,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399438328] [2022-11-25 16:58:08,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399438328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:08,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:08,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:58:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320867997] [2022-11-25 16:58:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:08,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:58:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:08,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:58:08,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:58:08,814 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:08,972 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-11-25 16:58:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:58:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-25 16:58:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:08,973 INFO L225 Difference]: With dead ends: 63 [2022-11-25 16:58:08,973 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 16:58:08,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:58:08,974 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 183 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:08,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 101 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:58:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 16:58:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-11-25 16:58:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-11-25 16:58:08,976 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 28 [2022-11-25 16:58:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:08,976 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-11-25 16:58:08,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-11-25 16:58:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:58:08,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:08,977 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] [2022-11-25 16:58:08,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:58:08,978 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -164034179, now seen corresponding path program 1 times [2022-11-25 16:58:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:08,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181710224] [2022-11-25 16:58:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:58:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:09,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181710224] [2022-11-25 16:58:09,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181710224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:09,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:09,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 16:58:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282158376] [2022-11-25 16:58:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:09,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 16:58:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 16:58:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:58:09,455 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:09,772 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-11-25 16:58:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:58:09,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 16:58:09,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:09,773 INFO L225 Difference]: With dead ends: 62 [2022-11-25 16:58:09,773 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 16:58:09,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-11-25 16:58:09,774 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 163 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:09,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 111 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:58:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 16:58:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-11-25 16:58:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-11-25 16:58:09,775 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 29 [2022-11-25 16:58:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:09,776 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-11-25 16:58:09,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-11-25 16:58:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 16:58:09,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:09,776 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-11-25 16:58:09,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:58:09,777 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:09,777 INFO L85 PathProgramCache]: Analyzing trace with hash -790092142, now seen corresponding path program 1 times [2022-11-25 16:58:09,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:09,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787193616] [2022-11-25 16:58:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:58:10,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:10,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787193616] [2022-11-25 16:58:10,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787193616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:10,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:10,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 16:58:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45304966] [2022-11-25 16:58:10,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:10,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:58:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:10,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:58:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:58:10,132 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:10,510 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-11-25 16:58:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:58:10,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 16:58:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:10,511 INFO L225 Difference]: With dead ends: 59 [2022-11-25 16:58:10,511 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 16:58:10,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:58:10,512 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 93 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:10,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 145 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:58:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 16:58:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 16:58:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 58 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-11-25 16:58:10,514 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 30 [2022-11-25 16:58:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:10,514 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-11-25 16:58:10,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-11-25 16:58:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 16:58:10,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:10,518 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] [2022-11-25 16:58:10,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:58:10,518 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1276947488, now seen corresponding path program 1 times [2022-11-25 16:58:10,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:10,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104852044] [2022-11-25 16:58:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 16:58:10,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:10,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104852044] [2022-11-25 16:58:10,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104852044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:10,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:10,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:58:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109766615] [2022-11-25 16:58:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:10,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:58:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:58:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:58:10,710 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:10,825 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-11-25 16:58:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:58:10,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 16:58:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:10,826 INFO L225 Difference]: With dead ends: 58 [2022-11-25 16:58:10,826 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 16:58:10,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:58:10,827 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:10,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:58:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 16:58:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 16:58:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-11-25 16:58:10,829 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 31 [2022-11-25 16:58:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:10,829 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-11-25 16:58:10,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-11-25 16:58:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 16:58:10,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:10,830 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] [2022-11-25 16:58:10,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 16:58:10,830 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458184, now seen corresponding path program 1 times [2022-11-25 16:58:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:10,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569992749] [2022-11-25 16:58:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 16:58:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:10,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569992749] [2022-11-25 16:58:10,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569992749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:10,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:10,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:10,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527988475] [2022-11-25 16:58:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:10,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:10,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:10,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:10,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:10,914 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:10,965 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-11-25 16:58:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:58:10,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-25 16:58:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:10,967 INFO L225 Difference]: With dead ends: 56 [2022-11-25 16:58:10,967 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 16:58:10,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:10,968 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:10,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:58:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 16:58:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 16:58:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-11-25 16:58:10,975 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 35 [2022-11-25 16:58:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:10,976 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-11-25 16:58:10,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-11-25 16:58:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 16:58:10,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:10,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:10,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 16:58:10,978 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435685, now seen corresponding path program 1 times [2022-11-25 16:58:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:10,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144063374] [2022-11-25 16:58:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:12,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:12,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144063374] [2022-11-25 16:58:12,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144063374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:58:12,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042629331] [2022-11-25 16:58:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:12,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:12,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:12,347 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:12,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 16:58:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:12,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-25 16:58:12,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:12,579 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-11-25 16:58:12,684 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:58:12,684 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-11-25 16:58:12,744 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 13 treesize of output 9 [2022-11-25 16:58:12,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:58:12,832 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:58:12,832 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 23 treesize of output 26 [2022-11-25 16:58:13,139 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-11-25 16:58:13,416 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-25 16:58:13,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 46 [2022-11-25 16:58:13,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-25 16:58:13,579 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 7 treesize of output 3 [2022-11-25 16:58:13,815 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 16:58:13,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-25 16:58:13,964 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 16:58:13,964 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 3 case distinctions, treesize of input 82 treesize of output 59 [2022-11-25 16:58:14,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:14,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 77 [2022-11-25 16:58:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:14,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:14,968 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 8 treesize of output 4 [2022-11-25 16:58:15,058 INFO L321 Elim1Store]: treesize reduction 13, result has 78.7 percent of original size [2022-11-25 16:58:15,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 99 [2022-11-25 16:58:15,824 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 72 treesize of output 56 [2022-11-25 16:58:15,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1328) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= .cse2 .cse0))))))) is different from false [2022-11-25 16:58:16,127 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1327 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1327))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse3 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (let ((.cse1 (select (select (store .cse3 .cse0 v_ArrVal_1328) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1))))))) is different from false [2022-11-25 16:58:16,158 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1325 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1325)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1327))) (let ((.cse1 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse3 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (let ((.cse0 (select (select (store .cse3 .cse2 v_ArrVal_1328) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse0 .cse2)))))))) is different from false [2022-11-25 16:58:16,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:16,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 107 [2022-11-25 16:58:16,211 INFO L321 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-11-25 16:58:16,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2052 treesize of output 1508 [2022-11-25 16:58:16,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:16,261 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 1182 treesize of output 1012 [2022-11-25 16:58:16,275 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 976 treesize of output 944 [2022-11-25 16:58:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 16:58:16,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042629331] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:16,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:58:16,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 59 [2022-11-25 16:58:16,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402291202] [2022-11-25 16:58:16,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:16,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-25 16:58:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:16,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-25 16:58:16,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2978, Unknown=32, NotChecked=336, Total=3540 [2022-11-25 16:58:16,769 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 60 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 60 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:21,649 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-11-25 16:58:21,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 16:58:21,650 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 60 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 16:58:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:21,651 INFO L225 Difference]: With dead ends: 95 [2022-11-25 16:58:21,651 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 16:58:21,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=751, Invalid=6035, Unknown=32, NotChecked=492, Total=7310 [2022-11-25 16:58:21,655 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 482 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:21,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 485 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1218 Invalid, 0 Unknown, 212 Unchecked, 1.2s Time] [2022-11-25 16:58:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 16:58:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 62. [2022-11-25 16:58:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-11-25 16:58:21,657 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 36 [2022-11-25 16:58:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:21,658 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-11-25 16:58:21,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 60 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-11-25 16:58:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 16:58:21,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:21,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:21,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:21,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:21,865 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435684, now seen corresponding path program 1 times [2022-11-25 16:58:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:21,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464033327] [2022-11-25 16:58:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464033327] [2022-11-25 16:58:22,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464033327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:58:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802427295] [2022-11-25 16:58:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:22,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:22,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:22,915 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:22,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 16:58:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:23,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-25 16:58:23,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:23,141 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-11-25 16:58:23,261 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:58:23,261 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-11-25 16:58:23,336 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 13 treesize of output 9 [2022-11-25 16:58:23,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:58:23,420 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 16 treesize of output 18 [2022-11-25 16:58:23,669 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 19 treesize of output 11 [2022-11-25 16:58:23,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:23,750 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-25 16:58:23,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 18 [2022-11-25 16:58:24,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:58:24,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 16:58:24,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 17 treesize of output 9 [2022-11-25 16:58:24,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 16:58:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:24,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:24,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2022-11-25 16:58:30,643 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:58:32,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:32,811 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 121 treesize of output 116 [2022-11-25 16:58:33,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-25 16:58:33,315 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 28 treesize of output 20 [2022-11-25 16:58:33,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1459))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ 4 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse0 4)))))))) is different from false [2022-11-25 16:58:33,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:33,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 53 [2022-11-25 16:58:33,772 INFO L321 Elim1Store]: treesize reduction 25, result has 65.3 percent of original size [2022-11-25 16:58:33,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 136 [2022-11-25 16:58:33,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:33,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 123 [2022-11-25 16:58:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 16:58:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802427295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:34,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:58:34,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 56 [2022-11-25 16:58:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504668655] [2022-11-25 16:58:34,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:34,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-25 16:58:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:34,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-25 16:58:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2853, Unknown=8, NotChecked=108, Total=3192 [2022-11-25 16:58:34,837 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 57 states, 56 states have (on average 1.875) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:41,619 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2022-11-25 16:58:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 16:58:41,619 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.875) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 16:58:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:41,620 INFO L225 Difference]: With dead ends: 114 [2022-11-25 16:58:41,620 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 16:58:41,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=870, Invalid=5932, Unknown=8, NotChecked=162, Total=6972 [2022-11-25 16:58:41,622 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 540 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:41,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 572 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1115 Invalid, 0 Unknown, 86 Unchecked, 0.9s Time] [2022-11-25 16:58:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 16:58:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 62. [2022-11-25 16:58:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 61 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-11-25 16:58:41,625 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 36 [2022-11-25 16:58:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:41,625 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-11-25 16:58:41,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.875) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-11-25 16:58:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 16:58:41,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:41,626 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] [2022-11-25 16:58:41,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:41,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:41,833 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:41,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1988076587, now seen corresponding path program 1 times [2022-11-25 16:58:41,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:41,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295126231] [2022-11-25 16:58:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:41,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:58:41,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:41,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295126231] [2022-11-25 16:58:41,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295126231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:58:41,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143928639] [2022-11-25 16:58:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:41,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:41,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:41,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 16:58:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:42,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 16:58:42,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 16:58:42,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 16:58:42,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143928639] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:42,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:58:42,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-25 16:58:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94933380] [2022-11-25 16:58:42,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:42,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:58:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:42,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:58:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:58:42,289 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:42,328 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-11-25 16:58:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:58:42,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-25 16:58:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:42,329 INFO L225 Difference]: With dead ends: 62 [2022-11-25 16:58:42,329 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 16:58:42,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:58:42,330 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 62 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:42,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 104 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:58:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 16:58:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 16:58:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-11-25 16:58:42,332 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 37 [2022-11-25 16:58:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:42,332 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-11-25 16:58:42,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-11-25 16:58:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 16:58:42,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:42,333 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] [2022-11-25 16:58:42,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:42,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:42,540 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 16:58:42,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash -695048217, now seen corresponding path program 1 times [2022-11-25 16:58:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:42,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245386307] [2022-11-25 16:58:42,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:42,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245386307] [2022-11-25 16:58:45,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245386307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:58:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531271621] [2022-11-25 16:58:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:45,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:45,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:45,038 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:45,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d74a1fef-6169-4be4-8c53-709f8847c4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 16:58:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-25 16:58:45,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:45,294 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-11-25 16:58:45,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:58:45,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:58:45,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:58:45,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:58:45,564 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:58:45,564 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-11-25 16:58:45,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:58:45,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:58:45,688 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-11-25 16:58:45,699 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-11-25 16:58:45,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:58:45,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 16:58:45,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:45,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:45,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:58:45,877 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 16:58:45,878 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 110 treesize of output 73 [2022-11-25 16:58:45,895 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-25 16:58:45,895 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 54 treesize of output 47 [2022-11-25 16:58:46,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:58:46,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:46,885 INFO L321 Elim1Store]: treesize reduction 154, result has 16.8 percent of original size [2022-11-25 16:58:46,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 118 treesize of output 91 [2022-11-25 16:58:46,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:46,940 INFO L321 Elim1Store]: treesize reduction 188, result has 16.4 percent of original size [2022-11-25 16:58:46,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 149 treesize of output 139 [2022-11-25 16:58:47,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:47,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:58:47,389 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-25 16:58:47,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 88 [2022-11-25 16:58:47,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:47,412 INFO L321 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-25 16:58:47,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 56 [2022-11-25 16:58:47,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:47,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:58:47,977 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-25 16:58:47,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 48 [2022-11-25 16:58:47,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:58:47,994 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 16:58:47,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2022-11-25 16:58:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:48,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:59:11,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:59:11,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1780 treesize of output 1296 [2022-11-25 16:59:11,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:59:11,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1300 treesize of output 936 [2022-11-25 16:59:11,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:59:11,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1780 treesize of output 1396 [2022-11-25 16:59:11,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:59:11,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1400 treesize of output 936 [2022-11-25 16:59:30,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:59:30,683 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 2 case distinctions, treesize of input 2210 treesize of output 1480 [2022-11-25 16:59:30,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:59:30,725 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 2 case distinctions, treesize of input 1490 treesize of output 940 [2022-11-25 16:59:30,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:00,194 WARN L233 SmtUtils]: Spent 27.74s on a formula simplification. DAG size of input: 308 DAG size of output: 204 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 17:00:00,195 INFO L321 Elim1Store]: treesize reduction 524, result has 44.7 percent of original size [2022-11-25 17:00:00,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 19 new quantified variables, introduced 66 case distinctions, treesize of input 2596932 treesize of output 2344178 [2022-11-25 17:00:49,097 INFO L217 Elim1Store]: Index analysis took 166 ms