./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc --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 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 --- 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-5e519f3 [2022-11-02 20:33:54,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:33:54,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:33:55,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:33:55,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:33:55,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:33:55,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:33:55,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:33:55,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:33:55,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:33:55,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:33:55,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:33:55,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:33:55,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:33:55,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:33:55,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:33:55,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:33:55,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:33:55,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:33:55,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:33:55,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:33:55,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:33:55,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:33:55,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:33:55,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:33:55,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:33:55,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:33:55,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:33:55,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:33:55,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:33:55,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:33:55,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:33:55,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:33:55,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:33:55,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:33:55,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:33:55,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:33:55,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:33:55,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:33:55,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:33:55,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:33:55,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:33:55,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:33:55,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:33:55,103 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:33:55,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:33:55,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:33:55,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:33:55,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:33:55,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:33:55,107 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:33:55,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:33:55,107 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:33:55,108 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:33:55,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:33:55,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:33:55,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:33:55,109 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:33:55,109 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:33:55,110 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:33:55,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:33:55,110 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:33:55,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:33:55,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:33:55,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:33:55,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:33:55,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:33:55,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:33:55,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:33:55,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:33:55,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:33:55,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:33:55,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/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_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc 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 -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 [2022-11-02 20:33:55,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:33:55,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:33:55,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:33:55,434 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:33:55,436 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:33:55,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-11-02 20:33:55,558 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/data/b4e1f55d5/f0bd2dd63dea4ca1bf183ddc57e893a8/FLAGca0ad6072 [2022-11-02 20:33:56,230 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:33:56,232 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-11-02 20:33:56,255 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/data/b4e1f55d5/f0bd2dd63dea4ca1bf183ddc57e893a8/FLAGca0ad6072 [2022-11-02 20:33:56,491 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/data/b4e1f55d5/f0bd2dd63dea4ca1bf183ddc57e893a8 [2022-11-02 20:33:56,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:33:56,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:33:56,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:33:56,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:33:56,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:33:56,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:33:56" (1/1) ... [2022-11-02 20:33:56,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb4b448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:56, skipping insertion in model container [2022-11-02 20:33:56,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:33:56" (1/1) ... [2022-11-02 20:33:56,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:33:56,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:33:57,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2022-11-02 20:33:57,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:33:57,116 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:33:57,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2022-11-02 20:33:57,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:33:57,231 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:33:57,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57 WrapperNode [2022-11-02 20:33:57,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:33:57,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:33:57,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:33:57,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:33:57,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,317 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2022-11-02 20:33:57,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:33:57,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:33:57,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:33:57,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:33:57,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,355 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:33:57,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:33:57,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:33:57,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:33:57,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (1/1) ... [2022-11-02 20:33:57,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:33:57,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:57,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:57,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:33:57,461 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 20:33:57,461 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 20:33:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:33:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:33:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:33:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:33:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:33:57,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:33:57,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:33:57,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:33:57,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:33:57,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:33:57,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:33:57,598 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:33:57,600 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:33:57,648 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 20:33:58,085 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:33:58,093 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:33:58,093 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:33:58,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:58 BoogieIcfgContainer [2022-11-02 20:33:58,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:33:58,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:33:58,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:33:58,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:33:58,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:33:56" (1/3) ... [2022-11-02 20:33:58,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f87199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:33:58, skipping insertion in model container [2022-11-02 20:33:58,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:57" (2/3) ... [2022-11-02 20:33:58,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f87199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:33:58, skipping insertion in model container [2022-11-02 20:33:58,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:58" (3/3) ... [2022-11-02 20:33:58,119 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2022-11-02 20:33:58,143 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:33:58,143 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-02 20:33:58,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:33:58,225 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=FINITE_AUTOMATA, 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;@7a10fd39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:33:58,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-11-02 20:33:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 40 states have (on average 2.1) internal successors, (84), 74 states have internal predecessors, (84), 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-02 20:33:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:33:58,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:58,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:33:58,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:33:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-02 20:33:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:58,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747193736] [2022-11-02 20:33:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,637 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-02 20:33:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:58,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747193736] [2022-11-02 20:33:58,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747193736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:58,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:58,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:33:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936938056] [2022-11-02 20:33:58,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:58,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:58,703 INFO L87 Difference]: Start difference. First operand has 76 states, 40 states have (on average 2.1) internal successors, (84), 74 states have internal predecessors, (84), 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-02 20:33:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:58,964 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-11-02 20:33:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:58,967 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-02 20:33:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:58,980 INFO L225 Difference]: With dead ends: 120 [2022-11-02 20:33:58,980 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:33:58,983 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-02 20:33:58,994 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 60 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:58,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:33:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:33:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2022-11-02 20:33:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 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-02 20:33:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-11-02 20:33:59,068 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 5 [2022-11-02 20:33:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:59,069 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-11-02 20:33:59,069 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-02 20:33:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-11-02 20:33:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:33:59,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:59,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:33:59,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:33:59,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:33:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-02 20:33:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:59,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208056800] [2022-11-02 20:33:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:59,196 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-02 20:33:59,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:59,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208056800] [2022-11-02 20:33:59,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208056800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:59,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:59,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:33:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014466817] [2022-11-02 20:33:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:59,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:59,201 INFO L87 Difference]: Start difference. First operand 68 states and 72 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-02 20:33:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:59,310 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-11-02 20:33:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:59,310 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-02 20:33:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:59,312 INFO L225 Difference]: With dead ends: 119 [2022-11-02 20:33:59,312 INFO L226 Difference]: Without dead ends: 119 [2022-11-02 20:33:59,313 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-02 20:33:59,314 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 65 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:59,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 138 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-02 20:33:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 65. [2022-11-02 20:33:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 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-02 20:33:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-02 20:33:59,323 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 5 [2022-11-02 20:33:59,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:59,324 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-02 20:33:59,324 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-02 20:33:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-02 20:33:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:33:59,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:59,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:59,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:33:59,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:33:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:59,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113103, now seen corresponding path program 1 times [2022-11-02 20:33:59,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:59,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457691241] [2022-11-02 20:33:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:59,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:59,383 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-02 20:33:59,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:59,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457691241] [2022-11-02 20:33:59,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457691241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:59,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:59,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:59,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295413322] [2022-11-02 20:33:59,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:59,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:59,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:59,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:59,387 INFO L87 Difference]: Start difference. First operand 65 states and 69 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-02 20:33:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:59,399 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-11-02 20:33:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:59,400 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-02 20:33:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:59,401 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:33:59,401 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:33:59,401 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-02 20:33:59,403 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 132 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-02 20:33:59,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:33:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2022-11-02 20:33:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 20:33:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-11-02 20:33:59,411 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-11-02 20:33:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:59,411 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-11-02 20:33:59,411 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-02 20:33:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-11-02 20:33:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:33:59,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:59,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:59,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:33:59,413 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:33:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-02 20:33:59,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:59,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093342521] [2022-11-02 20:33:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:59,558 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-02 20:33:59,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:59,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093342521] [2022-11-02 20:33:59,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093342521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:59,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:59,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388845697] [2022-11-02 20:33:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:59,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:33:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:59,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:59,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:59,561 INFO L87 Difference]: Start difference. First operand 66 states and 70 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-02 20:33:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:59,594 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-11-02 20:33:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:59,595 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-02 20:33:59,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:59,596 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:33:59,596 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:33:59,596 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-02 20:33:59,598 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 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-02 20:33:59,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:33:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-11-02 20:33:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 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-02 20:33:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-11-02 20:33:59,605 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 9 [2022-11-02 20:33:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:59,606 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-11-02 20:33:59,610 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-02 20:33:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-11-02 20:33:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:33:59,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:59,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:59,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:33:59,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:33:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash -763066850, now seen corresponding path program 1 times [2022-11-02 20:33:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:59,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927273381] [2022-11-02 20:33:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:59,842 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-02 20:33:59,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:59,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927273381] [2022-11-02 20:33:59,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927273381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:59,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326868771] [2022-11-02 20:33:59,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:59,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:59,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:59,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:33:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:00,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:34:00,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:00,072 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-02 20:34:00,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:00,109 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-02 20:34:00,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326868771] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:00,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:00,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 20:34:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101215096] [2022-11-02 20:34:00,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:00,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:34:00,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:34:00,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:34:00,113 INFO L87 Difference]: Start difference. First operand 71 states and 75 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-02 20:34:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:00,134 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-11-02 20:34:00,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:34:00,135 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-02 20:34:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:00,136 INFO L225 Difference]: With dead ends: 73 [2022-11-02 20:34:00,136 INFO L226 Difference]: Without dead ends: 73 [2022-11-02 20:34:00,137 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-02 20:34:00,138 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:00,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:34:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-02 20:34:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-02 20:34:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-11-02 20:34:00,151 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 14 [2022-11-02 20:34:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:00,151 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-11-02 20:34:00,151 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-02 20:34:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-11-02 20:34:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:34:00,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:00,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:00,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:00,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:00,383 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:00,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-02 20:34:00,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:00,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601584968] [2022-11-02 20:34:00,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:00,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:00,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601584968] [2022-11-02 20:34:00,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601584968] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:00,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685102419] [2022-11-02 20:34:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:00,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:00,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:00,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:00,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:34:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:00,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:34:00,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:00,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:00,780 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:34:00,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:00,801 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-02 20:34:00,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:01,002 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-02 20:34:01,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685102419] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:01,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:01,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-02 20:34:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212618285] [2022-11-02 20:34:01,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:01,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:34:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:34:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:34:01,006 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:01,182 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-11-02 20:34:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:34:01,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:34:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:01,184 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:34:01,184 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:34:01,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 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-02 20:34:01,185 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 161 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:01,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 154 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2022-11-02 20:34:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:34:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 72. [2022-11-02 20:34:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-11-02 20:34:01,193 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2022-11-02 20:34:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:01,193 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-11-02 20:34:01,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-11-02 20:34:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:34:01,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:01,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:01,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:01,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:01,422 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:01,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-02 20:34:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:01,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183613891] [2022-11-02 20:34:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:01,761 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-02 20:34:01,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183613891] [2022-11-02 20:34:01,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183613891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151283494] [2022-11-02 20:34:01,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:01,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:01,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:01,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:01,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:34:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:01,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:34:01,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:01,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:02,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:34:02,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:02,071 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:34:02,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:34:02,134 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-02 20:34:02,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:02,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-11-02 20:34:02,503 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-02 20:34:02,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151283494] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:02,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:02,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-02 20:34:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274588786] [2022-11-02 20:34:02,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:02,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:34:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:34:02,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:34:02,506 INFO L87 Difference]: Start difference. First operand 72 states and 76 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-02 20:34:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:02,773 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-11-02 20:34:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:34:02,774 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-02 20:34:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:02,775 INFO L225 Difference]: With dead ends: 115 [2022-11-02 20:34:02,775 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:34:02,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:34:02,776 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 223 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:02,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 128 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 120 Unchecked, 0.2s Time] [2022-11-02 20:34:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:34:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2022-11-02 20:34:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 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-02 20:34:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-11-02 20:34:02,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 16 [2022-11-02 20:34:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:02,783 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-11-02 20:34:02,783 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-02 20:34:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-11-02 20:34:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:34:02,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:02,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:02,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:02,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:02,985 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 2 times [2022-11-02 20:34:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:02,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068124015] [2022-11-02 20:34:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:03,098 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-02 20:34:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:03,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068124015] [2022-11-02 20:34:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068124015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512125481] [2022-11-02 20:34:03,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:34:03,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:03,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:03,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:03,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:34:03,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 20:34:03,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:34:03,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:34:03,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:03,279 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-02 20:34:03,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:34:03,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512125481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:03,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:34:03,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-02 20:34:03,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785472813] [2022-11-02 20:34:03,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:03,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:34:03,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:03,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:34:03,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:34:03,283 INFO L87 Difference]: Start difference. First operand 71 states and 75 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-02 20:34:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:03,305 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-11-02 20:34:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:34:03,306 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-02 20:34:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:03,307 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:34:03,307 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:34:03,307 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-02 20:34:03,311 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 127 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-02 20:34:03,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:34:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:34:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2022-11-02 20:34:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-11-02 20:34:03,327 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2022-11-02 20:34:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:03,327 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-11-02 20:34:03,327 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-02 20:34:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-11-02 20:34:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:34:03,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:03,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:03,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:03,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:03,550 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2022-11-02 20:34:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:03,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861719572] [2022-11-02 20:34:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:03,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:03,621 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-02 20:34:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861719572] [2022-11-02 20:34:03,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861719572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:03,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822864449] [2022-11-02 20:34:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:03,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:03,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:03,624 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:03,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:34:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:03,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:34:03,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:03,812 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-02 20:34:03,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:03,836 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-02 20:34:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822864449] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:03,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:03,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-02 20:34:03,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793929982] [2022-11-02 20:34:03,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:03,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:34:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:03,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:34:03,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:34:03,840 INFO L87 Difference]: Start difference. First operand 72 states and 76 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-02 20:34:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:03,878 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-02 20:34:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:34:03,879 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-02 20:34:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:03,880 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:34:03,880 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:34:03,880 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-02 20:34:03,881 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 63 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-02 20:34:03,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 63 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:34:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:34:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-02 20:34:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 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-02 20:34:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-11-02 20:34:03,886 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 21 [2022-11-02 20:34:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:03,887 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-11-02 20:34:03,887 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-02 20:34:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-11-02 20:34:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:34:03,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:03,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:03,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:04,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:04,101 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2022-11-02 20:34:04,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:04,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718720792] [2022-11-02 20:34:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:04,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:34:04,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:04,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718720792] [2022-11-02 20:34:04,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718720792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425428395] [2022-11-02 20:34:04,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:04,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:04,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:04,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:34:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:04,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:34:04,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:04,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:04,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:34:04,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:04,577 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:34:04,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:04,609 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-02 20:34:04,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:04,715 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-02 20:34:04,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425428395] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:04,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:04,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-11-02 20:34:04,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285109981] [2022-11-02 20:34:04,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:34:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:34:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:34:04,722 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:04,914 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-11-02 20:34:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:34:04,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:34:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:04,915 INFO L225 Difference]: With dead ends: 113 [2022-11-02 20:34:04,915 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:34:04,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:34:04,917 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 200 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:04,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 94 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 2 Unchecked, 0.1s Time] [2022-11-02 20:34:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:34:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2022-11-02 20:34:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 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-02 20:34:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-11-02 20:34:04,936 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 22 [2022-11-02 20:34:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:04,937 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-11-02 20:34:04,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-11-02 20:34:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:34:04,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:04,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:04,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:05,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:34:05,158 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2022-11-02 20:34:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:05,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206276575] [2022-11-02 20:34:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:05,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:05,623 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-02 20:34:05,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:05,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206276575] [2022-11-02 20:34:05,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206276575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:05,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207273144] [2022-11-02 20:34:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:05,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:05,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:05,626 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:05,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:34:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:05,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:34:05,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:05,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:05,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:34:05,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:05,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:34:05,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:05,957 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-02 20:34:05,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:08,310 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_28| Int)) (or (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int) (v_ArrVal_613 Int)) (or (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_614 Int)) (<= (+ |c_ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_28| v_ArrVal_613) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2022-11-02 20:34:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:34:08,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207273144] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:08,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:08,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 14 [2022-11-02 20:34:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475146281] [2022-11-02 20:34:08,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:08,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:34:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:34:08,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=127, Unknown=1, NotChecked=24, Total=210 [2022-11-02 20:34:08,333 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 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-02 20:34:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:08,570 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-11-02 20:34:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:34:08,571 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:34:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:08,572 INFO L225 Difference]: With dead ends: 96 [2022-11-02 20:34:08,572 INFO L226 Difference]: Without dead ends: 96 [2022-11-02 20:34:08,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=98, Invalid=177, Unknown=1, NotChecked=30, Total=306 [2022-11-02 20:34:08,573 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 242 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:08,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 50 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 112 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2022-11-02 20:34:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-02 20:34:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-11-02 20:34:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 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-02 20:34:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-11-02 20:34:08,576 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 22 [2022-11-02 20:34:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:08,576 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-11-02 20:34:08,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 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-02 20:34:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-11-02 20:34:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:34:08,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:08,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:08,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:08,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:08,778 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2022-11-02 20:34:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:08,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421675365] [2022-11-02 20:34:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:08,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:09,040 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-02 20:34:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:09,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421675365] [2022-11-02 20:34:09,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421675365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:09,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:09,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:34:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533102021] [2022-11-02 20:34:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:09,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:34:09,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:34:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:34:09,044 INFO L87 Difference]: Start difference. First operand 66 states and 69 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-02 20:34:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:09,329 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-11-02 20:34:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:34:09,329 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-02 20:34:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:09,330 INFO L225 Difference]: With dead ends: 95 [2022-11-02 20:34:09,330 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:34:09,331 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-02 20:34:09,331 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 156 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:09,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 181 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:34:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:34:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2022-11-02 20:34:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 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-02 20:34:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-11-02 20:34:09,334 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2022-11-02 20:34:09,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:09,335 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-11-02 20:34:09,335 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-02 20:34:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-11-02 20:34:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:34:09,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:09,337 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:09,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:34:09,338 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2022-11-02 20:34:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:09,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247890713] [2022-11-02 20:34:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:09,699 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-02 20:34:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:09,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247890713] [2022-11-02 20:34:09,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247890713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:09,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:09,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:34:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668975691] [2022-11-02 20:34:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:09,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:34:09,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:34:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:34:09,702 INFO L87 Difference]: Start difference. First operand 67 states and 71 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-02 20:34:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:10,034 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-02 20:34:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:34:10,034 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-02 20:34:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:10,035 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:34:10,035 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:34:10,035 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-02 20:34:10,036 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 282 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:10,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:34:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:34:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-11-02 20:34:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 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-02 20:34:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-11-02 20:34:10,039 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 23 [2022-11-02 20:34:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:10,039 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-11-02 20:34:10,039 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-02 20:34:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-11-02 20:34:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:34:10,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:10,040 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-02 20:34:10,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:34:10,040 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1033118353, now seen corresponding path program 1 times [2022-11-02 20:34:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:10,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863238555] [2022-11-02 20:34:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:10,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:10,213 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-02 20:34:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:10,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863238555] [2022-11-02 20:34:10,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863238555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:10,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:10,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:34:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259897340] [2022-11-02 20:34:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:10,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:34:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:10,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:34:10,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:34:10,216 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:10,384 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-02 20:34:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:34:10,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:34:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:10,385 INFO L225 Difference]: With dead ends: 66 [2022-11-02 20:34:10,386 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 20:34:10,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:34:10,387 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 224 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:10,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 82 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 20:34:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-02 20:34:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 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-02 20:34:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-11-02 20:34:10,389 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2022-11-02 20:34:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:10,390 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-11-02 20:34:10,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-11-02 20:34:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:34:10,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:10,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:10,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:34:10,391 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1961897973, now seen corresponding path program 1 times [2022-11-02 20:34:10,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:10,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883008716] [2022-11-02 20:34:10,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:10,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:10,658 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-02 20:34:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:10,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883008716] [2022-11-02 20:34:10,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883008716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:10,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:10,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:34:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652446540] [2022-11-02 20:34:10,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:10,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:34:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:34:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:34:10,661 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-02 20:34:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:10,952 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-11-02 20:34:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:34:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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 27 [2022-11-02 20:34:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:10,954 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:34:10,954 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:34:10,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:34:10,955 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 260 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:10,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 125 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:34:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:34:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2022-11-02 20:34:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 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-02 20:34:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-11-02 20:34:10,958 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 27 [2022-11-02 20:34:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:10,959 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-11-02 20:34:10,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-02 20:34:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-11-02 20:34:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:34:10,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:10,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:10,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:34:10,961 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328922, now seen corresponding path program 1 times [2022-11-02 20:34:10,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:10,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558624397] [2022-11-02 20:34:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:11,078 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-02 20:34:11,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:11,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558624397] [2022-11-02 20:34:11,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558624397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:11,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:11,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:34:11,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504509617] [2022-11-02 20:34:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:11,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:34:11,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:34:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:34:11,081 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-02 20:34:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:11,235 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-11-02 20:34:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:34:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 27 [2022-11-02 20:34:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:11,237 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:34:11,237 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:34:11,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:34:11,238 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:11,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 115 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:34:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-11-02 20:34:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 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-02 20:34:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-02 20:34:11,240 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 27 [2022-11-02 20:34:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:11,241 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-02 20:34:11,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-02 20:34:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-02 20:34:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:34:11,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:11,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:34:11,242 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328923, now seen corresponding path program 1 times [2022-11-02 20:34:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:11,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558244184] [2022-11-02 20:34:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:11,699 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-02 20:34:11,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:11,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558244184] [2022-11-02 20:34:11,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558244184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:11,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:11,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:34:11,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461679310] [2022-11-02 20:34:11,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:11,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:34:11,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:11,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:34:11,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:34:11,702 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-02 20:34:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:12,221 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-11-02 20:34:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:34:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 27 [2022-11-02 20:34:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:12,223 INFO L225 Difference]: With dead ends: 106 [2022-11-02 20:34:12,223 INFO L226 Difference]: Without dead ends: 106 [2022-11-02 20:34:12,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:34:12,224 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 317 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:12,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 184 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:34:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-02 20:34:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2022-11-02 20:34:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 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-02 20:34:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-11-02 20:34:12,228 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 27 [2022-11-02 20:34:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:12,228 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-11-02 20:34:12,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-02 20:34:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-11-02 20:34:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:34:12,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:12,229 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-02 20:34:12,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:34:12,229 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 689295123, now seen corresponding path program 1 times [2022-11-02 20:34:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:12,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025227571] [2022-11-02 20:34:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:12,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:12,349 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-02 20:34:12,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:12,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025227571] [2022-11-02 20:34:12,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025227571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:12,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:12,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:34:12,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663506999] [2022-11-02 20:34:12,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:12,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:34:12,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:12,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:34:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:34:12,355 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-02 20:34:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:12,457 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-11-02 20:34:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:34:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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 28 [2022-11-02 20:34:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:12,458 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:34:12,458 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:34:12,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:34:12,459 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:12,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 113 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:34:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-02 20:34:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-11-02 20:34:12,463 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2022-11-02 20:34:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:12,463 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-11-02 20:34:12,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-02 20:34:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-11-02 20:34:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:34:12,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:12,464 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-02 20:34:12,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:34:12,465 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash -106687560, now seen corresponding path program 1 times [2022-11-02 20:34:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:12,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58501857] [2022-11-02 20:34:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:12,786 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-02 20:34:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:12,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58501857] [2022-11-02 20:34:12,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58501857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:12,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492997952] [2022-11-02 20:34:12,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:12,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:12,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:12,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:12,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:34:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:12,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:34:12,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:13,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:34:13,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:13,134 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-02 20:34:13,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:34:13,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492997952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:13,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:34:13,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2022-11-02 20:34:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992108096] [2022-11-02 20:34:13,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:13,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:34:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:34:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:34:13,141 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-02 20:34:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:13,297 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-11-02 20:34:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:34:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 29 [2022-11-02 20:34:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:13,298 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:34:13,299 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:34:13,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:34:13,300 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 152 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:13,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 77 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:34:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-11-02 20:34:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 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-02 20:34:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-11-02 20:34:13,303 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 29 [2022-11-02 20:34:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:13,304 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-11-02 20:34:13,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-02 20:34:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-11-02 20:34:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:34:13,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:13,305 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-02 20:34:13,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:13,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:13,531 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash 307453124, now seen corresponding path program 1 times [2022-11-02 20:34:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:13,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525245484] [2022-11-02 20:34:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:14,302 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-02 20:34:14,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:14,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525245484] [2022-11-02 20:34:14,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525245484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:14,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:14,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:34:14,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944611027] [2022-11-02 20:34:14,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:14,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:34:14,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:14,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:34:14,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:34:14,304 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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-02 20:34:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:14,857 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-11-02 20:34:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:34:14,858 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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-02 20:34:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:14,858 INFO L225 Difference]: With dead ends: 77 [2022-11-02 20:34:14,858 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 20:34:14,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:34:14,859 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 224 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:14,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 183 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:34:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 20:34:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-11-02 20:34:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-02 20:34:14,862 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 29 [2022-11-02 20:34:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:14,862 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-02 20:34:14,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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-02 20:34:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-02 20:34:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:34:14,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:14,863 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-02 20:34:14,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:34:14,864 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash -890236208, now seen corresponding path program 1 times [2022-11-02 20:34:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:14,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071508754] [2022-11-02 20:34:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:15,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071508754] [2022-11-02 20:34:15,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071508754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:15,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243662031] [2022-11-02 20:34:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:15,610 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:15,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:34:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:15,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-02 20:34:15,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:15,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:15,956 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:34:15,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:34:16,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:34:16,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:34:16,077 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:34:16,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:16,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-11-02 20:34:16,517 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-02 20:34:16,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-11-02 20:34:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:16,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:16,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-11-02 20:34:16,983 INFO L356 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-02 20:34:16,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-11-02 20:34:16,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1200 (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_1200))) (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 (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-11-02 20:34:17,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (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_1197)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-02 20:34:17,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:17,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2022-11-02 20:34:17,109 INFO L356 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-11-02 20:34:17,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-11-02 20:34:17,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:17,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 104 [2022-11-02 20:34:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:34:17,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243662031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:17,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:17,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-11-02 20:34:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024878422] [2022-11-02 20:34:17,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:17,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:34:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:17,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:34:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1299, Unknown=2, NotChecked=146, Total=1560 [2022-11-02 20:34:17,355 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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-02 20:34:17,603 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse4 .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1197)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select .cse2 .cse1) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-11-02 20:34:17,609 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse1 .cse2) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-11-02 20:34:17,613 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse1 .cse2) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-11-02 20:34:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:19,226 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-11-02 20:34:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:34:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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-02 20:34:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:19,228 INFO L225 Difference]: With dead ends: 154 [2022-11-02 20:34:19,228 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 20:34:19,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=291, Invalid=2274, Unknown=5, NotChecked=510, Total=3080 [2022-11-02 20:34:19,231 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 364 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:19,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 645 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1061 Invalid, 0 Unknown, 416 Unchecked, 0.8s Time] [2022-11-02 20:34:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 20:34:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 94. [2022-11-02 20:34:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-11-02 20:34:19,235 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 31 [2022-11-02 20:34:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:19,236 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-11-02 20:34:19,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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-02 20:34:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-11-02 20:34:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:34:19,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:19,237 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-02 20:34:19,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-02 20:34:19,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:19,459 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -890236207, now seen corresponding path program 1 times [2022-11-02 20:34:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:19,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100363946] [2022-11-02 20:34:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:20,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:20,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100363946] [2022-11-02 20:34:20,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100363946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:20,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799035347] [2022-11-02 20:34:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:20,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:20,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:20,794 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:20,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:34:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:21,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-02 20:34:21,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:21,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:21,173 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:34:21,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:34:21,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:34:21,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:34:21,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:34:21,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:34:21,406 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:34:21,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 53 [2022-11-02 20:34:21,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-11-02 20:34:22,100 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:34:22,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2022-11-02 20:34:22,115 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-02 20:34:22,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-11-02 20:34:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:22,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:23,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:23,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 141 [2022-11-02 20:34:23,284 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |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.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse2 .cse0) (+ .cse1 4)) 4)))))) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse5 (select (select .cse3 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse3 .cse4) (+ .cse5 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse6 (select (select .cse7 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse7 .cse6) (+ .cse8 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))) is different from false [2022-11-02 20:34:23,468 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_prenex_3 Int) (v_ArrVal_1303 Int) (v_ArrVal_1302 Int) (v_prenex_4 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse2 (select (select .cse1 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse0)) (= (select (select .cse1 .cse2) (+ 4 .cse0)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse6 .cse7) (+ .cse8 4)) 4)) (not (= .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_3 Int) (v_ArrVal_1303 Int) (v_ArrVal_1302 Int) (v_prenex_4 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse11 (select (select .cse9 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse9 .cse10) (+ 4 .cse11)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse11)))))) (not (= .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2022-11-02 20:34:23,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:23,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 88 [2022-11-02 20:34:23,600 INFO L356 Elim1Store]: treesize reduction 15, result has 61.5 percent of original size [2022-11-02 20:34:23,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 231 [2022-11-02 20:34:23,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:23,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 176 treesize of output 131 [2022-11-02 20:34:23,763 INFO L356 Elim1Store]: treesize reduction 68, result has 48.5 percent of original size [2022-11-02 20:34:23,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 198 [2022-11-02 20:34:23,883 INFO L356 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-11-02 20:34:23,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 218 treesize of output 242 [2022-11-02 20:34:23,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:23,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 237 treesize of output 233 [2022-11-02 20:34:24,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 109 [2022-11-02 20:34:24,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2022-11-02 20:34:24,768 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 20:34:25,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2022-11-02 20:34:25,578 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 20:34:25,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-02 20:34:25,614 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 20:34:25,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-02 20:34:25,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-02 20:34:25,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-02 20:34:25,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:34:25,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:25,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-02 20:34:25,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:25,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-11-02 20:34:25,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:25,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 60 [2022-11-02 20:34:25,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:34:26,022 INFO L356 Elim1Store]: treesize reduction 87, result has 29.3 percent of original size [2022-11-02 20:34:26,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 124 treesize of output 111 [2022-11-02 20:34:26,082 INFO L356 Elim1Store]: treesize reduction 4, result has 89.7 percent of original size [2022-11-02 20:34:26,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 73 [2022-11-02 20:34:26,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-11-02 20:34:26,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:34:26,334 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:34:26,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 1 [2022-11-02 20:34:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:34:26,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799035347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:26,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:26,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 43 [2022-11-02 20:34:26,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297046405] [2022-11-02 20:34:26,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:26,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:34:26,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:26,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:34:26,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1606, Unknown=2, NotChecked=162, Total=1892 [2022-11-02 20:34:26,620 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:27,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select .cse7 .cse16)) (.cse8 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (= (select .cse9 .cse16) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse1 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and .cse0 (<= .cse1 12) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse2 (= .cse3 0) (forall ((v_prenex_3 Int) (v_ArrVal_1303 Int) (v_ArrVal_1302 Int) (v_prenex_4 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse8 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse6 (select (select .cse5 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse4)) (= (select (select .cse5 .cse6) (+ 4 .cse4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse8 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select .cse10 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse10 .cse11) (+ .cse12 4)) 4)) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse3) (forall ((v_prenex_3 Int) (v_ArrVal_1303 Int) (v_ArrVal_1302 Int) (v_prenex_4 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse8 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse15 (select (select .cse13 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse13 .cse14) (+ 4 .cse15)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse15)))))) (not (= .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (or (and .cse2 (<= 12 .cse1)) (and .cse0 (<= .cse1 11))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-02 20:34:27,021 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13)) (.cse7 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |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.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse2 .cse0) (+ .cse1 4)) 4)))))) .cse3 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse6 (select (select .cse4 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse4 .cse5) (+ .cse6 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse7 (= .cse8 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse8) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse9 (select (select .cse10 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse10 .cse9) (+ .cse11 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (let ((.cse12 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse7 (<= 12 .cse12)) (and .cse3 (<= .cse12 11))))))) is different from false [2022-11-02 20:34:27,031 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13)) (.cse7 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse13) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |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.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse2 .cse0) (+ .cse1 4)) 4)))))) .cse3 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse6 (select (select .cse4 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse4 .cse5) (+ .cse6 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse7 (= .cse8 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse8) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse9 (select (select .cse10 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse10 .cse9) (+ .cse11 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (let ((.cse12 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse7 (<= 12 .cse12)) (and .cse3 (<= .cse12 11))))))) is different from false [2022-11-02 20:34:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:29,849 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2022-11-02 20:34:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:34:29,852 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:34:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:29,854 INFO L225 Difference]: With dead ends: 239 [2022-11-02 20:34:29,854 INFO L226 Difference]: Without dead ends: 239 [2022-11-02 20:34:29,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=351, Invalid=3204, Unknown=5, NotChecked=600, Total=4160 [2022-11-02 20:34:29,863 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 557 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 829 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:29,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1294 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1428 Invalid, 0 Unknown, 829 Unchecked, 1.3s Time] [2022-11-02 20:34:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-02 20:34:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 94. [2022-11-02 20:34:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-11-02 20:34:29,868 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 31 [2022-11-02 20:34:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:29,868 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-11-02 20:34:29,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-11-02 20:34:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:34:29,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:29,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:29,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:30,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:30,094 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:30,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1649773349, now seen corresponding path program 1 times [2022-11-02 20:34:30,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:30,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474403556] [2022-11-02 20:34:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:30,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:30,200 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-02 20:34:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474403556] [2022-11-02 20:34:30,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474403556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:30,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:30,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:30,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735577876] [2022-11-02 20:34:30,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:30,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:34:30,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:30,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:34:30,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:34:30,203 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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-02 20:34:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:30,265 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-11-02 20:34:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:34:30,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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 33 [2022-11-02 20:34:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:30,267 INFO L225 Difference]: With dead ends: 99 [2022-11-02 20:34:30,267 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 20:34:30,267 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-02 20:34:30,268 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:30,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 41 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 20:34:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-02 20:34:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-11-02 20:34:30,272 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 33 [2022-11-02 20:34:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:30,273 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-11-02 20:34:30,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 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-02 20:34:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-11-02 20:34:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:34:30,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:30,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:30,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:34:30,275 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash -818501958, now seen corresponding path program 1 times [2022-11-02 20:34:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:30,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167298583] [2022-11-02 20:34:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:34:30,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:30,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167298583] [2022-11-02 20:34:30,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167298583] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:30,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564105907] [2022-11-02 20:34:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:30,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:30,434 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:30,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:34:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:30,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 20:34:30,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:30,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:34:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:34:30,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:30,725 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-02 20:34:30,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-02 20:34:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:34:30,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564105907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:30,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:30,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-11-02 20:34:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989362538] [2022-11-02 20:34:30,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:30,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:34:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:34:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:34:30,733 INFO L87 Difference]: Start difference. First operand 99 states and 110 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-02 20:34:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:30,927 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-11-02 20:34:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:34:30,927 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 33 [2022-11-02 20:34:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:30,928 INFO L225 Difference]: With dead ends: 99 [2022-11-02 20:34:30,928 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 20:34:30,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:34:30,929 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 35 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:30,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 130 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 20:34:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-11-02 20:34:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 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-02 20:34:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2022-11-02 20:34:30,932 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 33 [2022-11-02 20:34:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:30,933 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2022-11-02 20:34:30,933 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-02 20:34:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2022-11-02 20:34:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:34:30,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:30,933 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:30,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:31,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:34:31,142 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash -818501957, now seen corresponding path program 1 times [2022-11-02 20:34:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:31,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247607619] [2022-11-02 20:34:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:34:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247607619] [2022-11-02 20:34:31,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247607619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136388389] [2022-11-02 20:34:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:31,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:31,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:31,658 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:31,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:34:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:31,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:34:31,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:31,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-02 20:34:31,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-02 20:34:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:34:32,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:32,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:32,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-11-02 20:34:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:34:32,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136388389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:32,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:32,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2022-11-02 20:34:32,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108099188] [2022-11-02 20:34:32,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:32,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:34:32,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:32,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:34:32,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:34:32,271 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:33,796 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-11-02 20:34:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:34:33,797 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:34:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:33,798 INFO L225 Difference]: With dead ends: 135 [2022-11-02 20:34:33,798 INFO L226 Difference]: Without dead ends: 135 [2022-11-02 20:34:33,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2022-11-02 20:34:33,800 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 368 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:33,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 302 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:34:33,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-02 20:34:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-11-02 20:34:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-02 20:34:33,804 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 33 [2022-11-02 20:34:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:33,805 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-02 20:34:33,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-02 20:34:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:34:33,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:33,806 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] [2022-11-02 20:34:33,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:34,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-02 20:34:34,034 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 396633763, now seen corresponding path program 1 times [2022-11-02 20:34:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:34,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523089875] [2022-11-02 20:34:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523089875] [2022-11-02 20:34:35,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523089875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:35,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926052842] [2022-11-02 20:34:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:35,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:35,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:35,583 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:35,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:34:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:35,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 20:34:35,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:35,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:36,009 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:34:36,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:36,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:34:36,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:34:36,228 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:34:36,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:34:36,651 INFO L356 Elim1Store]: treesize reduction 4, result has 88.6 percent of original size [2022-11-02 20:34:36,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 48 [2022-11-02 20:34:36,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:34:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:36,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:36,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-02 20:34:37,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (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_1671))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-11-02 20:34:37,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse1 (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_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) 4) 0)))))) is different from false [2022-11-02 20:34:37,282 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:37,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 50 [2022-11-02 20:34:37,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:37,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 154 [2022-11-02 20:34:37,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:37,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 103 [2022-11-02 20:34:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:34:38,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926052842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:38,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:38,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 50 [2022-11-02 20:34:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617261237] [2022-11-02 20:34:38,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:38,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:34:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:34:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2115, Unknown=2, NotChecked=186, Total=2450 [2022-11-02 20:34:39,007 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:39,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (not .cse6)) (.cse0 (select |c_#valid| 0)) (.cse1 (select .cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse2 (= .cse0 1)) (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (not (= (select (select .cse4 .cse3) 4) 0)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse6 (not (= .cse1 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-02 20:34:39,462 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse5)) (.cse0 (select |c_#valid| 0)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse1 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse2 .cse3) 4) 0)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (= .cse0 1)) (= (select .cse4 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse5 (not (= (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-11-02 20:34:39,467 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse0 (= (select |c_#valid| 0) 1)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-11-02 20:34:40,994 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse5)) (.cse0 (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (= (select |c_#valid| 0) 1)) (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (not (= (select (select .cse3 .cse2) 4) 0)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse5 (not (= .cse0 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-02 20:34:41,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse0 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse0 (= (select |c_#valid| 0) 1)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2022-11-02 20:34:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:41,462 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-11-02 20:34:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:34:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:34:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:41,464 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:34:41,464 INFO L226 Difference]: Without dead ends: 123 [2022-11-02 20:34:41,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=434, Invalid=3877, Unknown=7, NotChecked=938, Total=5256 [2022-11-02 20:34:41,467 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 362 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:41,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1027 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1236 Invalid, 0 Unknown, 400 Unchecked, 1.0s Time] [2022-11-02 20:34:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-02 20:34:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2022-11-02 20:34:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 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-02 20:34:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-11-02 20:34:41,471 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 34 [2022-11-02 20:34:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:41,471 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-11-02 20:34:41,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-11-02 20:34:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:34:41,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:41,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:41,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:41,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:34:41,690 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash -601364006, now seen corresponding path program 1 times [2022-11-02 20:34:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:41,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934066167] [2022-11-02 20:34:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:41,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:42,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:42,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934066167] [2022-11-02 20:34:42,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934066167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:42,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705101300] [2022-11-02 20:34:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:42,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:42,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:42,425 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:42,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:34:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:42,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-02 20:34:42,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:42,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:42,803 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:34:42,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:34:42,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:34:42,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:34:42,933 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:34:42,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-02 20:34:43,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2022-11-02 20:34:43,416 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-02 20:34:43,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2022-11-02 20:34:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:43,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:43,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-11-02 20:34:43,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (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.base|)) (<= (+ (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) is different from false [2022-11-02 20:34:43,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1784 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (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_1784)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (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.base|)) (<= (+ (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) is different from false [2022-11-02 20:34:43,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:43,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 53 [2022-11-02 20:34:43,931 INFO L356 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2022-11-02 20:34:43,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 143 [2022-11-02 20:34:43,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:43,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 110 [2022-11-02 20:34:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:34:44,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705101300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:44,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:44,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 40 [2022-11-02 20:34:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687098478] [2022-11-02 20:34:44,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:44,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 20:34:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 20:34:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1368, Unknown=2, NotChecked=150, Total=1640 [2022-11-02 20:34:44,594 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:44,892 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse4 .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1784 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1784)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) .cse3) 1) |c_#StackHeapBarrier|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:34:44,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) .cse3) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:34:44,902 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) .cse3) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:34:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:46,563 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-11-02 20:34:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:34:46,565 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-02 20:34:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:46,566 INFO L225 Difference]: With dead ends: 167 [2022-11-02 20:34:46,566 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 20:34:46,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=315, Invalid=2456, Unknown=5, NotChecked=530, Total=3306 [2022-11-02 20:34:46,568 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 249 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 692 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:46,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1332 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1282 Invalid, 0 Unknown, 692 Unchecked, 0.9s Time] [2022-11-02 20:34:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 20:34:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 98. [2022-11-02 20:34:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-11-02 20:34:46,573 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 35 [2022-11-02 20:34:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:46,574 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-11-02 20:34:46,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-11-02 20:34:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:34:46,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:46,575 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:34:46,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:46,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 20:34:46,791 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-02 20:34:46,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash -601311418, now seen corresponding path program 2 times [2022-11-02 20:34:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:46,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046795252] [2022-11-02 20:34:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046795252] [2022-11-02 20:34:48,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046795252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846929038] [2022-11-02 20:34:48,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:34:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:48,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:48,775 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:48,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6387eb-87c1-456b-986c-dae7a1f55d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:34:48,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:34:48,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:34:49,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-02 20:34:49,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:49,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:49,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:34:49,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:34:49,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:34:49,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:34:49,299 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:34:49,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:34:49,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:34:49,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:34:49,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:34:49,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:34:49,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 20:34:49,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:34:49,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:34:49,556 INFO L356 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2022-11-02 20:34:49,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 68 [2022-11-02 20:34:49,577 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-02 20:34:49,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 62 [2022-11-02 20:34:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:50,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:53,775 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_1904)))) (let ((.cse0 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse0)) (= (let ((.cse3 (+ 4 .cse0))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)))))) (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_1904)))) (let ((.cse10 (select (select .cse7 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse9 (+ 4 .cse10))) (select (select .cse7 (select (select .cse1 .cse8) .cse9)) (+ (select (select .cse7 .cse8) .cse9) 4))) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse10)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8))))))))) is different from false [2022-11-02 20:34:55,859 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse8 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse2 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse8 v_ArrVal_1898)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1904)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_1900)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse0 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse1)) (= (let ((.cse4 (+ .cse1 4))) (select (select .cse2 (select (select .cse3 .cse0) .cse4)) (+ (select (select .cse2 .cse0) .cse4) 4))) 0))))) (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse14 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse8 v_ArrVal_1898)))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1904)))) (.cse11 (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_1900)))) (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse12 (select (select .cse11 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (select (select .cse14 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse13 (+ .cse15 4))) (select (select .cse11 (select (select .cse11 .cse12) .cse13)) (+ (select (select .cse14 .cse12) .cse13) 4))) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse15)))))))) is different from false [2022-11-02 20:34:57,918 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse8 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse9 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse4 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse11 .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse9 v_ArrVal_1898)))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1904)))) (.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse7 .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_1900)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse4 |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.base|)) (not (= .cse1 |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (let ((.cse3 (+ .cse1 4))) (select (select .cse2 (select (select .cse2 .cse0) .cse3)) (+ 4 (select (select .cse4 .cse0) .cse3)))) 0)))))) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse18 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse19 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse13 (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse11 .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse19 v_ArrVal_1898)))) (store .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1904)))) (.cse14 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse7 .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse19 v_ArrVal_1900)))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse12 (select (select .cse14 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (let ((.cse15 (+ .cse16 4))) (select (select .cse13 (select (select .cse14 .cse12) .cse15)) (+ 4 (select (select .cse13 .cse12) .cse15)))) 0) (not (= .cse16 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) is different from false [2022-11-02 20:34:57,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:57,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 334 treesize of output 270 [2022-11-02 20:34:57,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:57,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 674 treesize of output 230 [2022-11-02 20:34:58,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:58,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 334 treesize of output 250 [2022-11-02 20:34:58,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:34:58,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 574 treesize of output 230 [2022-11-02 20:34:58,074 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_10))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1904)))) (.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_11))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_10 .cse0))) (= (select (select .cse1 (select (select .cse1 .cse2) .cse0)) (+ (select (select .cse3 .cse2) .cse0) 4)) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (not (= (select v_arrayElimArr_11 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse8 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_13))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (.cse7 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_12))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1904))))) (let ((.cse10 (+ (select (select .cse7 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse9 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse7 (select (select .cse8 .cse9) .cse10)) (+ (select (select .cse7 .cse9) .cse10) 4)) 0) (not (= (select v_arrayElimArr_13 .cse10) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_12 .cse10))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9)))))))) is different from false [2022-11-02 20:35:00,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:35:00,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 476 treesize of output 346 [2022-11-02 20:35:00,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:35:00,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 324 treesize of output 194 [2022-11-02 20:35:00,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:00,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:35:00,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3320 treesize of output 3226 [2022-11-02 20:35:01,168 INFO L244 Elim1Store]: Index analysis took 133 ms [2022-11-02 20:35:43,272 WARN L234 SmtUtils]: Spent 42.03s on a formula simplification. DAG size of input: 2335 DAG size of output: 959 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 20:35:43,283 INFO L356 Elim1Store]: treesize reduction 5110, result has 33.6 percent of original size [2022-11-02 20:35:43,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 56 new quantified variables, introduced 561 case distinctions, treesize of input 1300898 treesize of output 1109738 [2022-11-02 20:35:51,729 WARN L234 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 4747 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:35:59,594 WARN L234 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 4681 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:36:02,054 INFO L244 Elim1Store]: Index analysis took 589 ms [2022-11-02 20:36:12,028 WARN L234 SmtUtils]: Spent 9.92s on a formula simplification. DAG size of input: 475 DAG size of output: 267 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 20:36:12,029 INFO L356 Elim1Store]: treesize reduction 1346, result has 49.4 percent of original size [2022-11-02 20:36:12,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 1393763 treesize of output 1168285 [2022-11-02 20:37:20,862 WARN L234 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 5020 DAG size of output: 5006 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:37:24,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:24,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1284079 treesize of output 1186742