./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a --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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- 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-b5237d8 [2022-11-21 13:42:05,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:42:05,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:42:05,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:42:05,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:42:05,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:42:05,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:42:05,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:42:05,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:42:05,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:42:05,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:42:05,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:42:05,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:42:05,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:42:05,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:42:05,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:42:05,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:42:05,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:42:05,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:42:05,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:42:05,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:42:05,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:42:05,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:42:05,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:42:05,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:42:05,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:42:05,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:42:05,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:42:05,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:42:05,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:42:05,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:42:05,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:42:05,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:42:05,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:42:05,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:42:05,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:42:05,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:42:05,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:42:05,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:42:05,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:42:05,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:42:05,265 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 13:42:05,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:42:05,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:42:05,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:42:05,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:42:05,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:42:05,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:42:05,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:42:05,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:42:05,306 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:42:05,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:42:05,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:42:05,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:42:05,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:42:05,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:42:05,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:42:05,309 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:42:05,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:42:05,309 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:42:05,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:42:05,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:42:05,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:42:05,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:42:05,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:42:05,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:42:05,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:42:05,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:42:05,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:42:05,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:42:05,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:42:05,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:42:05,312 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_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/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_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-11-21 13:42:05,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:42:05,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:42:05,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:42:05,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:42:05,669 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:42:05,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-21 13:42:08,683 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:42:09,002 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:42:09,003 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-21 13:42:09,015 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/data/123c425f8/6dc5fa6799ba4ad6b3bca3a097fe824a/FLAG1347b2516 [2022-11-21 13:42:09,028 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/data/123c425f8/6dc5fa6799ba4ad6b3bca3a097fe824a [2022-11-21 13:42:09,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:42:09,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:42:09,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:42:09,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:42:09,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:42:09,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6027b152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09, skipping insertion in model container [2022-11-21 13:42:09,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:42:09,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:42:09,486 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-21 13:42:09,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:42:09,500 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:42:09,569 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-21 13:42:09,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:42:09,607 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:42:09,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09 WrapperNode [2022-11-21 13:42:09,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:42:09,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:42:09,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:42:09,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:42:09,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,655 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 160 [2022-11-21 13:42:09,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:42:09,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:42:09,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:42:09,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:42:09,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,697 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:42:09,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:42:09,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:42:09,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:42:09,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (1/1) ... [2022-11-21 13:42:09,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:42:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:09,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:42:09,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:42:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:42:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:42:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 13:42:09,803 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 13:42:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:42:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:42:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:42:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:42:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:42:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:42:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 13:42:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:42:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:42:09,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:42:09,927 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:42:09,928 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:42:10,528 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:42:10,538 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:42:10,541 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 13:42:10,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:42:10 BoogieIcfgContainer [2022-11-21 13:42:10,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:42:10,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:42:10,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:42:10,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:42:10,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:42:09" (1/3) ... [2022-11-21 13:42:10,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe792aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:42:10, skipping insertion in model container [2022-11-21 13:42:10,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:09" (2/3) ... [2022-11-21 13:42:10,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe792aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:42:10, skipping insertion in model container [2022-11-21 13:42:10,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:42:10" (3/3) ... [2022-11-21 13:42:10,557 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-11-21 13:42:10,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:42:10,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-21 13:42:10,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:42:10,639 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;@5622c751, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:42:10,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-21 13:42:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 149 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:42:10,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:10,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:42:10,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash 896534515, now seen corresponding path program 1 times [2022-11-21 13:42:10,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:10,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584713474] [2022-11-21 13:42:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:10,985 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-21 13:42:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:10,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584713474] [2022-11-21 13:42:10,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584713474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:10,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:10,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:42:10,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347753711] [2022-11-21 13:42:10,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:10,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:42:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:42:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:42:11,062 INFO L87 Difference]: Start difference. First operand has 154 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 149 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:42:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:11,285 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-11-21 13:42:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:42:11,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-21 13:42:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:11,296 INFO L225 Difference]: With dead ends: 151 [2022-11-21 13:42:11,296 INFO L226 Difference]: Without dead ends: 148 [2022-11-21 13:42:11,298 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-21 13:42:11,301 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:11,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 240 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:42:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-21 13:42:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-21 13:42:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 75 states have (on average 2.026666666666667) internal successors, (152), 143 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-11-21 13:42:11,345 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 6 [2022-11-21 13:42:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:11,345 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-11-21 13:42:11,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:42:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-11-21 13:42:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:42:11,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:11,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:42:11,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:42:11,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash 896534514, now seen corresponding path program 1 times [2022-11-21 13:42:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:11,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810317793] [2022-11-21 13:42:11,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:11,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:11,411 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-21 13:42:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:11,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810317793] [2022-11-21 13:42:11,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810317793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:11,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:11,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:42:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192710824] [2022-11-21 13:42:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:11,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:42:11,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:11,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:42:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:42:11,415 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:42:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:11,588 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-11-21 13:42:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:42:11,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-21 13:42:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:11,596 INFO L225 Difference]: With dead ends: 145 [2022-11-21 13:42:11,596 INFO L226 Difference]: Without dead ends: 145 [2022-11-21 13:42:11,597 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-21 13:42:11,598 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:11,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 229 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:42:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-21 13:42:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-21 13:42:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 140 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-11-21 13:42:11,616 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 6 [2022-11-21 13:42:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:11,618 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-11-21 13:42:11,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:42:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-11-21 13:42:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:42:11,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:11,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:11,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:42:11,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash 976905444, now seen corresponding path program 1 times [2022-11-21 13:42:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75571984] [2022-11-21 13:42:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:11,876 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-21 13:42:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:11,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75571984] [2022-11-21 13:42:11,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75571984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:11,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:11,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:42:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843846066] [2022-11-21 13:42:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:11,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:42:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:42:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:42:11,881 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 13:42:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:12,059 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2022-11-21 13:42:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:42:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-21 13:42:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:12,061 INFO L225 Difference]: With dead ends: 156 [2022-11-21 13:42:12,061 INFO L226 Difference]: Without dead ends: 156 [2022-11-21 13:42:12,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:42:12,063 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:12,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:42:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-21 13:42:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2022-11-21 13:42:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 141 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2022-11-21 13:42:12,075 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 14 [2022-11-21 13:42:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:12,075 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2022-11-21 13:42:12,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 13:42:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2022-11-21 13:42:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:42:12,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:12,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:12,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:42:12,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 302098592, now seen corresponding path program 1 times [2022-11-21 13:42:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:12,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216237212] [2022-11-21 13:42:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:12,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:42:12,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:12,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216237212] [2022-11-21 13:42:12,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216237212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:12,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:12,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:42:12,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765934645] [2022-11-21 13:42:12,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:12,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:42:12,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:12,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:42:12,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:42:12,297 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:42:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:12,653 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-21 13:42:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:42:12,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-21 13:42:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:12,657 INFO L225 Difference]: With dead ends: 146 [2022-11-21 13:42:12,658 INFO L226 Difference]: Without dead ends: 146 [2022-11-21 13:42:12,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:12,659 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 21 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:12,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 484 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:42:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-21 13:42:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2022-11-21 13:42:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 140 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-11-21 13:42:12,667 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 24 [2022-11-21 13:42:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:12,668 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-11-21 13:42:12,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:42:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-11-21 13:42:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:42:12,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:12,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:12,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:42:12,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 302098593, now seen corresponding path program 1 times [2022-11-21 13:42:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:12,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171465969] [2022-11-21 13:42:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:42:13,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:13,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171465969] [2022-11-21 13:42:13,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171465969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:13,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:13,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:42:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684048572] [2022-11-21 13:42:13,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:13,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:42:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:42:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:42:13,116 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:42:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:13,517 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-11-21 13:42:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:42:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-21 13:42:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:13,521 INFO L225 Difference]: With dead ends: 145 [2022-11-21 13:42:13,521 INFO L226 Difference]: Without dead ends: 145 [2022-11-21 13:42:13,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:13,523 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 19 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:13,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 508 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:42:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-21 13:42:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2022-11-21 13:42:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 76 states have (on average 1.9473684210526316) internal successors, (148), 139 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2022-11-21 13:42:13,530 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 24 [2022-11-21 13:42:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:13,530 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2022-11-21 13:42:13,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:42:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2022-11-21 13:42:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 13:42:13,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:13,531 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:13,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:42:13,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029503, now seen corresponding path program 1 times [2022-11-21 13:42:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:13,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710589468] [2022-11-21 13:42:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:42:13,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:13,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710589468] [2022-11-21 13:42:13,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710589468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:13,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448265884] [2022-11-21 13:42:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:13,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:13,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:13,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:13,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:42:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:14,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:42:14,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:14,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:14,311 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-21 13:42:14,405 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:42:14,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:42:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 13:42:14,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:14,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448265884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:14,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:42:14,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-21 13:42:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487963304] [2022-11-21 13:42:14,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:14,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:42:14,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:42:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-21 13:42:14,549 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:15,092 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2022-11-21 13:42:15,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:42:15,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-21 13:42:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:15,094 INFO L225 Difference]: With dead ends: 169 [2022-11-21 13:42:15,095 INFO L226 Difference]: Without dead ends: 169 [2022-11-21 13:42:15,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-21 13:42:15,102 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 128 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:15,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 457 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 495 Invalid, 0 Unknown, 175 Unchecked, 0.4s Time] [2022-11-21 13:42:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-21 13:42:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2022-11-21 13:42:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.925) internal successors, (154), 143 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 13:42:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-11-21 13:42:15,117 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 26 [2022-11-21 13:42:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:15,120 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-11-21 13:42:15,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-11-21 13:42:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 13:42:15,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:15,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:15,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:15,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:15,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029502, now seen corresponding path program 1 times [2022-11-21 13:42:15,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:15,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507473903] [2022-11-21 13:42:15,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:15,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:42:15,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:15,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507473903] [2022-11-21 13:42:15,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507473903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:15,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890777323] [2022-11-21 13:42:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:15,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:15,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:15,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:15,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:42:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:16,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-21 13:42:16,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:16,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:16,395 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_493 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-21 13:42:16,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:16,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:42:16,481 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:42:16,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:42:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 13:42:16,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:20,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890777323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:20,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:42:20,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2022-11-21 13:42:20,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120814745] [2022-11-21 13:42:20,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:20,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 13:42:20,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:20,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 13:42:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2022-11-21 13:42:20,735 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:42:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:21,847 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-11-21 13:42:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:42:21,853 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-11-21 13:42:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:21,854 INFO L225 Difference]: With dead ends: 151 [2022-11-21 13:42:21,854 INFO L226 Difference]: Without dead ends: 151 [2022-11-21 13:42:21,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-11-21 13:42:21,855 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 18 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:21,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 940 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1183 Invalid, 0 Unknown, 156 Unchecked, 1.0s Time] [2022-11-21 13:42:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-21 13:42:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-11-21 13:42:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.9125) internal successors, (153), 143 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 13:42:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-11-21 13:42:21,874 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 26 [2022-11-21 13:42:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:21,875 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-11-21 13:42:21,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:42:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-11-21 13:42:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:42:21,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:21,876 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] [2022-11-21 13:42:21,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:22,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 13:42:22,082 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:22,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1908047191, now seen corresponding path program 1 times [2022-11-21 13:42:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:22,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189383050] [2022-11-21 13:42:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:22,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:42:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:22,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189383050] [2022-11-21 13:42:22,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189383050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:22,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071239413] [2022-11-21 13:42:22,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:22,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:22,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:22,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:22,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:42:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:22,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 13:42:22,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:42:22,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:42:22,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071239413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:42:22,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:42:22,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-21 13:42:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763960447] [2022-11-21 13:42:22,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:22,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:42:22,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:22,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:42:22,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:42:22,474 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:42:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:22,705 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2022-11-21 13:42:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:42:22,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-21 13:42:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:22,707 INFO L225 Difference]: With dead ends: 150 [2022-11-21 13:42:22,707 INFO L226 Difference]: Without dead ends: 150 [2022-11-21 13:42:22,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:22,708 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:22,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 750 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:42:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-21 13:42:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-11-21 13:42:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.9) internal successors, (152), 143 states have internal predecessors, (152), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 13:42:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-11-21 13:42:22,713 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 28 [2022-11-21 13:42:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:22,714 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-11-21 13:42:22,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:42:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-11-21 13:42:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:42:22,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:22,715 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] [2022-11-21 13:42:22,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 13:42:22,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:22,921 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:22,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:22,921 INFO L85 PathProgramCache]: Analyzing trace with hash -984859886, now seen corresponding path program 1 times [2022-11-21 13:42:22,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:22,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249861892] [2022-11-21 13:42:22,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:22,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:23,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:23,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:42:23,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:23,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249861892] [2022-11-21 13:42:23,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249861892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:23,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978177458] [2022-11-21 13:42:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:23,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:23,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:23,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:23,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:42:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:23,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:42:23,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:42:23,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:23,249 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:42:23,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:42:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:42:23,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978177458] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:42:23,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:42:23,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-21 13:42:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725388334] [2022-11-21 13:42:23,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:23,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:42:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:42:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:42:23,279 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:23,572 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-11-21 13:42:23,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:42:23,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-21 13:42:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:23,573 INFO L225 Difference]: With dead ends: 154 [2022-11-21 13:42:23,573 INFO L226 Difference]: Without dead ends: 154 [2022-11-21 13:42:23,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:23,574 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 13 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:23,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 351 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:42:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-21 13:42:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-11-21 13:42:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.891566265060241) internal successors, (157), 146 states have internal predecessors, (157), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 13:42:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-11-21 13:42:23,579 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 29 [2022-11-21 13:42:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:23,579 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-11-21 13:42:23,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-11-21 13:42:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:42:23,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:23,580 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] [2022-11-21 13:42:23,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:23,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:23,781 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash -984859885, now seen corresponding path program 1 times [2022-11-21 13:42:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:23,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389120071] [2022-11-21 13:42:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:23,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:24,041 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-21 13:42:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:24,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389120071] [2022-11-21 13:42:24,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389120071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:24,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836255193] [2022-11-21 13:42:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:24,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:24,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:24,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:24,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:42:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:24,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 13:42:24,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:24,366 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-21 13:42:24,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:24,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:42:24,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-21 13:42:24,563 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-21 13:42:24,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836255193] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:42:24,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:42:24,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-21 13:42:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568804315] [2022-11-21 13:42:24,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:24,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 13:42:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:24,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:42:24,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:42:24,565 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-21 13:42:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:25,012 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-11-21 13:42:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:42:25,013 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-21 13:42:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:25,014 INFO L225 Difference]: With dead ends: 159 [2022-11-21 13:42:25,014 INFO L226 Difference]: Without dead ends: 159 [2022-11-21 13:42:25,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-21 13:42:25,015 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 22 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:25,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1422 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:42:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-21 13:42:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2022-11-21 13:42:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.8795180722891567) internal successors, (156), 146 states have internal predecessors, (156), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 13:42:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-11-21 13:42:25,020 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 29 [2022-11-21 13:42:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:25,021 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-11-21 13:42:25,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-21 13:42:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-11-21 13:42:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:42:25,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:25,022 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] [2022-11-21 13:42:25,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:25,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 13:42:25,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash -465885389, now seen corresponding path program 1 times [2022-11-21 13:42:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:25,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974103810] [2022-11-21 13:42:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:25,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:25,408 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-21 13:42:25,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:25,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974103810] [2022-11-21 13:42:25,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974103810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:25,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:25,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:42:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431585189] [2022-11-21 13:42:25,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:25,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:42:25,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:25,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:42:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:25,413 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:42:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:25,817 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-21 13:42:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:42:25,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-21 13:42:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:25,818 INFO L225 Difference]: With dead ends: 152 [2022-11-21 13:42:25,818 INFO L226 Difference]: Without dead ends: 152 [2022-11-21 13:42:25,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:42:25,819 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:25,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 542 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:42:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-21 13:42:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2022-11-21 13:42:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 145 states have internal predecessors, (155), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 13:42:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2022-11-21 13:42:25,823 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 30 [2022-11-21 13:42:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:25,824 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-11-21 13:42:25,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:42:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2022-11-21 13:42:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:42:25,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:25,825 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] [2022-11-21 13:42:25,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:42:25,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash -465885388, now seen corresponding path program 1 times [2022-11-21 13:42:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:25,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124786300] [2022-11-21 13:42:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:25,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:26,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:26,093 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-21 13:42:26,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:26,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124786300] [2022-11-21 13:42:26,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124786300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:26,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:26,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:42:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039421376] [2022-11-21 13:42:26,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:26,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:42:26,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:26,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:42:26,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:26,096 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:42:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:26,530 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2022-11-21 13:42:26,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:42:26,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-21 13:42:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:26,536 INFO L225 Difference]: With dead ends: 150 [2022-11-21 13:42:26,536 INFO L226 Difference]: Without dead ends: 150 [2022-11-21 13:42:26,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:42:26,538 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:26,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 572 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:42:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-21 13:42:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-21 13:42:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 83 states have (on average 1.855421686746988) internal successors, (154), 144 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 13:42:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2022-11-21 13:42:26,544 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 30 [2022-11-21 13:42:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:26,545 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2022-11-21 13:42:26,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:42:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2022-11-21 13:42:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 13:42:26,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:26,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:26,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:42:26,548 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1959133359, now seen corresponding path program 1 times [2022-11-21 13:42:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:26,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603721965] [2022-11-21 13:42:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:26,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:26,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 13:42:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 13:42:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:26,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603721965] [2022-11-21 13:42:26,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603721965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645312365] [2022-11-21 13:42:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:26,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:26,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:26,730 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:26,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:42:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:26,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:42:26,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:42:26,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:42:26,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645312365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:26,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:42:26,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-21 13:42:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127366950] [2022-11-21 13:42:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:26,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:42:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:42:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:42:26,987 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:27,001 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-11-21 13:42:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:42:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-21 13:42:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:27,003 INFO L225 Difference]: With dead ends: 138 [2022-11-21 13:42:27,003 INFO L226 Difference]: Without dead ends: 138 [2022-11-21 13:42:27,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:42:27,004 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 170 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-21 13:42:27,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 170 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:42:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-21 13:42:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-21 13:42:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 133 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-11-21 13:42:27,009 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 41 [2022-11-21 13:42:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:27,010 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-11-21 13:42:27,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-11-21 13:42:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 13:42:27,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:27,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:27,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:27,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 13:42:27,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:27,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash -930567857, now seen corresponding path program 1 times [2022-11-21 13:42:27,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:27,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119897273] [2022-11-21 13:42:27,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:27,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:27,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:27,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:42:27,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:27,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119897273] [2022-11-21 13:42:27,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119897273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:27,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409511184] [2022-11-21 13:42:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:27,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:27,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:27,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:27,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:42:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:28,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 13:42:28,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:28,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:28,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:42:28,100 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1582))) is different from true [2022-11-21 13:42:28,116 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1582))) is different from true [2022-11-21 13:42:28,135 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:42:28,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-21 13:42:28,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 13:42:28,221 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1583 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1583))))) is different from true [2022-11-21 13:42:28,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:28,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:42:28,338 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-21 13:42:28,361 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:42:28,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:42:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2022-11-21 13:42:28,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:28,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409511184] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:28,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:42:28,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2022-11-21 13:42:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455827472] [2022-11-21 13:42:28,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:28,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 13:42:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 13:42:28,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=221, Unknown=4, NotChecked=132, Total=420 [2022-11-21 13:42:28,650 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-21 13:42:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:29,302 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2022-11-21 13:42:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:42:29,303 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-21 13:42:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:29,304 INFO L225 Difference]: With dead ends: 146 [2022-11-21 13:42:29,304 INFO L226 Difference]: Without dead ends: 146 [2022-11-21 13:42:29,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=304, Unknown=4, NotChecked=156, Total=552 [2022-11-21 13:42:29,305 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 571 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 599 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:29,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 394 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 561 Invalid, 0 Unknown, 599 Unchecked, 0.5s Time] [2022-11-21 13:42:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-21 13:42:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2022-11-21 13:42:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 123 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-11-21 13:42:29,308 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 43 [2022-11-21 13:42:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:29,309 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-11-21 13:42:29,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-21 13:42:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-11-21 13:42:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 13:42:29,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:29,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:29,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:29,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 13:42:29,518 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash -930567856, now seen corresponding path program 1 times [2022-11-21 13:42:29,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:29,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426024576] [2022-11-21 13:42:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:30,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:42:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426024576] [2022-11-21 13:42:30,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426024576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987310207] [2022-11-21 13:42:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:30,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:30,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:30,315 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:30,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:42:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:30,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:42:30,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:30,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:30,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:42:30,630 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))))) is different from true [2022-11-21 13:42:30,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:30,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:42:30,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:42:30,742 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-21 13:42:30,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:30,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:42:30,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:42:30,885 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1824 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1824))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-21 13:42:30,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:30,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:42:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-21 13:42:30,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:31,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987310207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:31,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:42:31,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2022-11-21 13:42:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967782611] [2022-11-21 13:42:31,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:31,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 13:42:31,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 13:42:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=3, NotChecked=102, Total=420 [2022-11-21 13:42:31,111 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:42:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:31,793 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-11-21 13:42:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:42:31,794 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-11-21 13:42:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:31,795 INFO L225 Difference]: With dead ends: 136 [2022-11-21 13:42:31,795 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 13:42:31,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=335, Unknown=3, NotChecked=120, Total=552 [2022-11-21 13:42:31,796 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 529 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:31,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 379 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 515 Invalid, 0 Unknown, 357 Unchecked, 0.6s Time] [2022-11-21 13:42:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 13:42:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2022-11-21 13:42:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 113 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2022-11-21 13:42:31,801 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 43 [2022-11-21 13:42:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:31,801 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2022-11-21 13:42:31,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:42:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2022-11-21 13:42:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 13:42:31,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:31,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:31,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-21 13:42:32,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 13:42:32,009 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883970, now seen corresponding path program 1 times [2022-11-21 13:42:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:32,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136259947] [2022-11-21 13:42:32,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:32,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 13:42:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:33,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136259947] [2022-11-21 13:42:33,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136259947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:33,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051261663] [2022-11-21 13:42:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:33,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:33,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:33,053 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:33,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:42:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:33,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-21 13:42:33,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:33,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:33,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-21 13:42:33,804 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2064 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2064))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-21 13:42:33,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:33,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:42:33,872 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-21 13:42:33,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:42:33,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:42:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-21 13:42:33,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:34,032 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_52| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_52| v_ArrVal_2070) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_52| |c_#StackHeapBarrier|)))) is different from false [2022-11-21 13:42:34,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051261663] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:34,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:42:34,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-11-21 13:42:34,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730982958] [2022-11-21 13:42:34,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:34,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 13:42:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:34,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 13:42:34,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=623, Unknown=3, NotChecked=102, Total=812 [2022-11-21 13:42:34,036 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 13:42:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:35,421 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2022-11-21 13:42:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:42:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-21 13:42:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:35,424 INFO L225 Difference]: With dead ends: 223 [2022-11-21 13:42:35,424 INFO L226 Difference]: Without dead ends: 223 [2022-11-21 13:42:35,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=208, Invalid=1127, Unknown=5, NotChecked=142, Total=1482 [2022-11-21 13:42:35,426 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1384 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 34 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:35,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 675 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1022 Invalid, 3 Unknown, 142 Unchecked, 1.0s Time] [2022-11-21 13:42:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-21 13:42:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 125. [2022-11-21 13:42:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 120 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2022-11-21 13:42:35,431 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 46 [2022-11-21 13:42:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:35,432 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2022-11-21 13:42:35,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 13:42:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2022-11-21 13:42:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 13:42:35,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:35,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:35,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:35,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 13:42:35,640 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883971, now seen corresponding path program 1 times [2022-11-21 13:42:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:35,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773476562] [2022-11-21 13:42:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:36,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:42:37,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:37,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773476562] [2022-11-21 13:42:37,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773476562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:37,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338545736] [2022-11-21 13:42:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:37,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:37,512 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:37,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 13:42:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:37,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-21 13:42:37,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:37,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:37,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:38,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-21 13:42:38,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:42:38,651 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2310 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2310)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2311)))) is different from true [2022-11-21 13:42:38,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:38,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-21 13:42:38,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:38,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-21 13:42:38,762 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 13:42:38,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 13:42:38,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-21 13:42:38,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-21 13:42:38,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:42:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-21 13:42:38,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:39,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338545736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:39,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:42:39,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2022-11-21 13:42:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640272821] [2022-11-21 13:42:39,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:39,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 13:42:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:39,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 13:42:39,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1015, Unknown=1, NotChecked=64, Total=1190 [2022-11-21 13:42:39,984 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 13:42:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:42,235 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2022-11-21 13:42:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:42:42,236 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-21 13:42:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:42,237 INFO L225 Difference]: With dead ends: 204 [2022-11-21 13:42:42,237 INFO L226 Difference]: Without dead ends: 204 [2022-11-21 13:42:42,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=220, Invalid=1763, Unknown=1, NotChecked=86, Total=2070 [2022-11-21 13:42:42,239 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 523 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:42,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1017 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1798 Invalid, 0 Unknown, 124 Unchecked, 1.6s Time] [2022-11-21 13:42:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-21 13:42:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 125. [2022-11-21 13:42:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6265060240963856) internal successors, (135), 120 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2022-11-21 13:42:42,244 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 46 [2022-11-21 13:42:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:42,244 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2022-11-21 13:42:42,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 13:42:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-11-21 13:42:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 13:42:42,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:42,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:42,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:42,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:42,452 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1771238793, now seen corresponding path program 1 times [2022-11-21 13:42:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:42,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744925354] [2022-11-21 13:42:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:42:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:42,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744925354] [2022-11-21 13:42:42,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744925354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:42,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:42,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:42:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466315017] [2022-11-21 13:42:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:42,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:42:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:42:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:42:42,569 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:42,697 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-11-21 13:42:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:42:42,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2022-11-21 13:42:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:42,699 INFO L225 Difference]: With dead ends: 164 [2022-11-21 13:42:42,699 INFO L226 Difference]: Without dead ends: 164 [2022-11-21 13:42:42,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:42:42,700 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 77 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:42,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 258 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:42:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-21 13:42:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 121. [2022-11-21 13:42:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-11-21 13:42:42,703 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 47 [2022-11-21 13:42:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:42,704 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-11-21 13:42:42,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-11-21 13:42:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 13:42:42,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:42,704 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:42,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:42:42,705 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997608, now seen corresponding path program 1 times [2022-11-21 13:42:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:42,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745638930] [2022-11-21 13:42:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 13:42:42,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:42,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745638930] [2022-11-21 13:42:42,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745638930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:42,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:42,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:42:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677447526] [2022-11-21 13:42:42,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:42,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:42:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:42,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:42:42,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:42:42,896 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:43,170 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-21 13:42:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:42:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-11-21 13:42:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:43,172 INFO L225 Difference]: With dead ends: 133 [2022-11-21 13:42:43,172 INFO L226 Difference]: Without dead ends: 133 [2022-11-21 13:42:43,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:43,173 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 85 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:43,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 307 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:42:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-21 13:42:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2022-11-21 13:42:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-11-21 13:42:43,176 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 49 [2022-11-21 13:42:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:43,176 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-11-21 13:42:43,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-11-21 13:42:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 13:42:43,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:43,177 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:43,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 13:42:43,177 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:43,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997607, now seen corresponding path program 1 times [2022-11-21 13:42:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:43,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690834900] [2022-11-21 13:42:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:42:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:43,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690834900] [2022-11-21 13:42:43,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690834900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:43,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:43,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:42:43,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341824701] [2022-11-21 13:42:43,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:43,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:42:43,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:42:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:42:43,355 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:43,494 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-11-21 13:42:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:42:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-21 13:42:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:43,496 INFO L225 Difference]: With dead ends: 114 [2022-11-21 13:42:43,496 INFO L226 Difference]: Without dead ends: 114 [2022-11-21 13:42:43,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:42:43,497 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:43,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 277 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:42:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-21 13:42:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-21 13:42:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-11-21 13:42:43,500 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 49 [2022-11-21 13:42:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:43,500 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-11-21 13:42:43,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-11-21 13:42:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 13:42:43,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:43,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:43,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 13:42:43,501 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:43,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1351857860, now seen corresponding path program 1 times [2022-11-21 13:42:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:43,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520089605] [2022-11-21 13:42:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:42:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:43,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520089605] [2022-11-21 13:42:43,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520089605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:43,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:43,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:42:43,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404047973] [2022-11-21 13:42:43,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:43,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:42:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:43,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:42:43,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:42:43,724 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:43,853 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2022-11-21 13:42:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:42:43,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-21 13:42:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:43,854 INFO L225 Difference]: With dead ends: 111 [2022-11-21 13:42:43,855 INFO L226 Difference]: Without dead ends: 111 [2022-11-21 13:42:43,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:43,855 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 177 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:43,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 219 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:42:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-21 13:42:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-21 13:42:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2022-11-21 13:42:43,858 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 49 [2022-11-21 13:42:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:43,858 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2022-11-21 13:42:43,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:42:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2022-11-21 13:42:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 13:42:43,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:43,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:43,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 13:42:43,859 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077693, now seen corresponding path program 1 times [2022-11-21 13:42:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:43,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805627207] [2022-11-21 13:42:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:42:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805627207] [2022-11-21 13:42:43,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805627207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:43,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:43,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:42:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402904706] [2022-11-21 13:42:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:43,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:42:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:42:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:42:43,996 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:44,181 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-11-21 13:42:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:42:44,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-11-21 13:42:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:44,183 INFO L225 Difference]: With dead ends: 169 [2022-11-21 13:42:44,183 INFO L226 Difference]: Without dead ends: 169 [2022-11-21 13:42:44,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:42:44,184 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 163 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:44,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 215 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:42:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-21 13:42:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 110. [2022-11-21 13:42:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 105 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2022-11-21 13:42:44,187 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 50 [2022-11-21 13:42:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:44,187 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2022-11-21 13:42:44,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-11-21 13:42:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 13:42:44,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:44,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:44,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:42:44,188 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077694, now seen corresponding path program 1 times [2022-11-21 13:42:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:44,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402642411] [2022-11-21 13:42:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:42:44,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:44,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402642411] [2022-11-21 13:42:44,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402642411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:44,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:44,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:42:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237962122] [2022-11-21 13:42:44,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:44,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:42:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:42:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:42:44,359 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:44,540 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-11-21 13:42:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:42:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-11-21 13:42:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:44,541 INFO L225 Difference]: With dead ends: 109 [2022-11-21 13:42:44,541 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 13:42:44,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:42:44,542 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:44,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 202 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:42:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 13:42:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-21 13:42:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-11-21 13:42:44,545 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 50 [2022-11-21 13:42:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:44,545 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-11-21 13:42:44,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-11-21 13:42:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 13:42:44,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:44,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:44,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 13:42:44,547 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:44,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2055329845, now seen corresponding path program 1 times [2022-11-21 13:42:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:44,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221618747] [2022-11-21 13:42:44,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 13:42:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:44,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221618747] [2022-11-21 13:42:44,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221618747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:44,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:44,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:42:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210201298] [2022-11-21 13:42:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:42:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:44,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:42:44,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:42:44,869 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:45,098 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-11-21 13:42:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:42:45,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-11-21 13:42:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:45,099 INFO L225 Difference]: With dead ends: 103 [2022-11-21 13:42:45,099 INFO L226 Difference]: Without dead ends: 103 [2022-11-21 13:42:45,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:42:45,100 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:45,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 310 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:42:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-21 13:42:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-21 13:42:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 98 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-21 13:42:45,103 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 51 [2022-11-21 13:42:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:45,103 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-21 13:42:45,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:42:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-21 13:42:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 13:42:45,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:45,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:45,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 13:42:45,105 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:45,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:45,105 INFO L85 PathProgramCache]: Analyzing trace with hash 512975501, now seen corresponding path program 1 times [2022-11-21 13:42:45,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:45,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517969717] [2022-11-21 13:42:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:46,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:42:47,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517969717] [2022-11-21 13:42:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517969717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070484231] [2022-11-21 13:42:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:47,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:47,749 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:47,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 13:42:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-21 13:42:48,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:48,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:48,492 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:42:48,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:42:48,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:42:48,818 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:42:48,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-11-21 13:42:49,036 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:42:49,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:42:49,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:49,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-21 13:42:49,304 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:42:49,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-11-21 13:42:49,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:42:49,584 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3634 (Array Int Int)) (v_ArrVal_3635 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3635)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3634)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-21 13:42:49,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:49,655 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:42:49,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-11-21 13:42:49,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:49,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:42:49,708 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-21 13:42:49,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-21 13:42:49,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:42:49,998 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:42:49,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-21 13:42:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-21 13:42:50,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:50,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070484231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:50,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:42:50,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-11-21 13:42:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780560622] [2022-11-21 13:42:50,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:42:50,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-21 13:42:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-21 13:42:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2083, Unknown=1, NotChecked=92, Total=2352 [2022-11-21 13:42:50,411 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 13:42:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:53,703 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-21 13:42:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:42:53,704 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-11-21 13:42:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:53,705 INFO L225 Difference]: With dead ends: 121 [2022-11-21 13:42:53,705 INFO L226 Difference]: Without dead ends: 121 [2022-11-21 13:42:53,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=396, Invalid=3267, Unknown=1, NotChecked=118, Total=3782 [2022-11-21 13:42:53,706 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 349 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:53,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1219 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1939 Invalid, 0 Unknown, 126 Unchecked, 1.8s Time] [2022-11-21 13:42:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-21 13:42:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2022-11-21 13:42:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 97 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:42:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-11-21 13:42:53,710 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 53 [2022-11-21 13:42:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:53,711 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-11-21 13:42:53,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 13:42:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-11-21 13:42:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 13:42:53,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:53,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:53,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:53,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-21 13:42:53,919 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:42:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash 512975502, now seen corresponding path program 1 times [2022-11-21 13:42:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:53,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731253154] [2022-11-21 13:42:53,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:55,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:42:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:42:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:42:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731253154] [2022-11-21 13:42:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731253154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603351275] [2022-11-21 13:42:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:57,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:57,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:57,496 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:57,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 13:42:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:57,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-21 13:42:57,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:57,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:42:58,369 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:42:58,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:42:58,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:42:58,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:42:58,810 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:42:58,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2022-11-21 13:42:58,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:42:59,116 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:42:59,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2022-11-21 13:42:59,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:42:59,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:59,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-11-21 13:42:59,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:59,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2022-11-21 13:42:59,549 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:42:59,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 40 [2022-11-21 13:42:59,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2022-11-21 13:42:59,831 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3937 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_3936 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3937)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3936) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-21 13:42:59,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:59,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:59,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:59,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-11-21 13:42:59,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:59,908 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:42:59,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 67 [2022-11-21 13:42:59,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:42:59,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 27 [2022-11-21 13:42:59,946 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 13:42:59,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-21 13:43:00,292 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-21 13:43:00,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 47 [2022-11-21 13:43:00,302 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:43:00,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2022-11-21 13:43:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-21 13:43:00,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:43:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603351275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:43:01,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:43:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-11-21 13:43:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072279174] [2022-11-21 13:43:01,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:43:01,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-21 13:43:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:43:01,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-21 13:43:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3013, Unknown=1, NotChecked=110, Total=3306 [2022-11-21 13:43:01,170 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 13:43:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:43:06,543 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-11-21 13:43:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 13:43:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-11-21 13:43:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:43:06,544 INFO L225 Difference]: With dead ends: 101 [2022-11-21 13:43:06,544 INFO L226 Difference]: Without dead ends: 101 [2022-11-21 13:43:06,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=421, Invalid=4838, Unknown=1, NotChecked=142, Total=5402 [2022-11-21 13:43:06,546 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 371 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:43:06,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1245 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2108 Invalid, 0 Unknown, 105 Unchecked, 2.1s Time] [2022-11-21 13:43:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-21 13:43:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-21 13:43:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:43:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-11-21 13:43:06,550 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 53 [2022-11-21 13:43:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:43:06,550 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-11-21 13:43:06,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 13:43:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-11-21 13:43:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 13:43:06,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:43:06,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:43:06,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:43:06,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 13:43:06,759 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:43:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:43:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash 167962770, now seen corresponding path program 1 times [2022-11-21 13:43:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:43:06,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268324588] [2022-11-21 13:43:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:43:06,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:43:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:43:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:43:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:43:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:43:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:43:10,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268324588] [2022-11-21 13:43:10,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268324588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:43:10,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948230920] [2022-11-21 13:43:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:43:10,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:43:10,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:43:10,199 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:43:10,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 13:43:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:10,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-21 13:43:10,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:43:10,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:43:10,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:43:10,791 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:43:10,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:43:10,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:43:11,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:43:11,227 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:43:11,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-21 13:43:11,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:43:11,647 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:43:11,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-21 13:43:11,956 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:43:11,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:43:12,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:43:12,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-21 13:43:12,408 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:43:12,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-11-21 13:43:12,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:43:12,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-21 13:43:12,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:43:24,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:43:24,092 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 13:43:24,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2022-11-21 13:43:24,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:43:24,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:43:24,259 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 13:43:24,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:43:24,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:43:24,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-21 13:43:26,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:43:30,608 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:43:30,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 192 treesize of output 131 [2022-11-21 13:43:30,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 100 [2022-11-21 13:43:31,457 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:43:31,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2022-11-21 13:43:31,719 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:43:31,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2022-11-21 13:43:32,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-21 13:43:32,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-21 13:43:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:43:32,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:43:55,977 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-21 13:43:55,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-11-21 13:44:02,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948230920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:44:02,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:44:02,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 61 [2022-11-21 13:44:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812018341] [2022-11-21 13:44:02,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:44:02,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-21 13:44:02,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-21 13:44:02,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4669, Unknown=187, NotChecked=0, Total=5112 [2022-11-21 13:44:02,962 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:44:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:28,798 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2022-11-21 13:44:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 13:44:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-11-21 13:44:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:28,800 INFO L225 Difference]: With dead ends: 225 [2022-11-21 13:44:28,800 INFO L226 Difference]: Without dead ends: 225 [2022-11-21 13:44:28,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=697, Invalid=7671, Unknown=188, NotChecked=0, Total=8556 [2022-11-21 13:44:28,803 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 973 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:28,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1323 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-11-21 13:44:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-21 13:44:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 104. [2022-11-21 13:44:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.308641975308642) internal successors, (106), 99 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:44:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-11-21 13:44:28,807 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 57 [2022-11-21 13:44:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:28,808 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-11-21 13:44:28,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:44:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-11-21 13:44:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 13:44:28,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:28,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:28,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 13:44:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-21 13:44:29,017 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:44:29,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash 167962771, now seen corresponding path program 1 times [2022-11-21 13:44:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:29,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357026713] [2022-11-21 13:44:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:44:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:35,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:44:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:44:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:44:39,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:39,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357026713] [2022-11-21 13:44:39,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357026713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:44:39,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235839212] [2022-11-21 13:44:39,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:39,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:44:39,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:44:39,514 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:44:39,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 13:44:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:39,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-21 13:44:39,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:44:39,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:44:39,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:44:40,823 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:44:40,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:44:41,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:44:42,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:44:42,785 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:44:42,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-21 13:44:43,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:44:44,393 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:44:44,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-21 13:44:45,529 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:44:45,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:44:46,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:44:46,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-21 13:44:47,110 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:44:47,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2022-11-21 13:44:47,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:44:47,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:44:47,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-21 13:44:47,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:45:49,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:49,608 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 13:45:49,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 58 [2022-11-21 13:45:49,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:49,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-21 13:45:49,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:49,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:49,802 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 13:45:49,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:45:49,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:49,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-21 13:45:58,159 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:45:58,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 143 [2022-11-21 13:45:58,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:58,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-21 13:45:58,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2022-11-21 13:45:59,372 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:45:59,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:45:59,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:45:59,482 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:45:59,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2022-11-21 13:46:00,376 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:00,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2022-11-21 13:46:00,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:00,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:46:01,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-21 13:46:01,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:46:01,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-21 13:46:01,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:46:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:46:02,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:04,224 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4562 (Array Int Int)) (v_ArrVal_4563 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4563) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4562 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-21 13:46:24,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235839212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:24,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:46:24,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 65 [2022-11-21 13:46:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673064018] [2022-11-21 13:46:24,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:24,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-21 13:46:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:24,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-21 13:46:24,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=5685, Unknown=42, NotChecked=152, Total=6162 [2022-11-21 13:46:24,059 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:46:26,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:32,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:35,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:39,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:41,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:43,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:46,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:48,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:51,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:54,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:46:58,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:04,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:09,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:14,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:19,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:23,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:28,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:33,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:35,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:39,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:41,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:43,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:45,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:48,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:50,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:52,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:55,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:47:58,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:02,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:06,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:08,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:12,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:15,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:18,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:20,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:24,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:26,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:28,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:31,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:33,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:35,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:38,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:40,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:43,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:46,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:49,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:51,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:53,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:55,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:48:58,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:00,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:03,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:07,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:09,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:13,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:15,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:19,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:21,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:23,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:26,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:28,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:31,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:34,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:36,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:38,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:49:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:38,438 INFO L93 Difference]: Finished difference Result 223 states and 240 transitions. [2022-11-21 13:49:38,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 13:49:38,438 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-11-21 13:49:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:38,440 INFO L225 Difference]: With dead ends: 223 [2022-11-21 13:49:38,440 INFO L226 Difference]: Without dead ends: 223 [2022-11-21 13:49:38,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 129.8s TimeCoverageRelationStatistics Valid=728, Invalid=9134, Unknown=42, NotChecked=196, Total=10100 [2022-11-21 13:49:38,443 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1003 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 106 mSolverCounterUnsat, 65 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 160.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 65 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 167.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:38,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1344 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2839 Invalid, 65 Unknown, 0 Unchecked, 167.9s Time] [2022-11-21 13:49:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-21 13:49:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 106. [2022-11-21 13:49:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 101 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:49:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-11-21 13:49:38,448 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 57 [2022-11-21 13:49:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:38,449 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-11-21 13:49:38,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:49:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-11-21 13:49:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 13:49:38,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:38,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:38,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 13:49:38,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 13:49:38,657 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:49:38,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560249, now seen corresponding path program 1 times [2022-11-21 13:49:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:38,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127252532] [2022-11-21 13:49:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:49:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:49:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:49:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:39,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127252532] [2022-11-21 13:49:39,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127252532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:39,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716611919] [2022-11-21 13:49:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:39,323 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:39,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 13:49:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:39,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-21 13:49:39,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:40,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:49:40,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:49:41,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:49:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 13:49:41,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:49:41,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716611919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:41,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:49:41,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 17 [2022-11-21 13:49:41,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960914277] [2022-11-21 13:49:41,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:41,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:49:41,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:41,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:49:41,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:49:41,324 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:49:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:43,939 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-11-21 13:49:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:49:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-11-21 13:49:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:43,941 INFO L225 Difference]: With dead ends: 167 [2022-11-21 13:49:43,941 INFO L226 Difference]: Without dead ends: 167 [2022-11-21 13:49:43,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-21 13:49:43,952 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 219 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:43,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 544 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-21 13:49:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-21 13:49:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2022-11-21 13:49:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:49:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-11-21 13:49:43,966 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2022-11-21 13:49:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:43,967 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-11-21 13:49:43,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:49:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-11-21 13:49:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 13:49:43,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:43,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:43,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-21 13:49:44,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-21 13:49:44,176 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:49:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560248, now seen corresponding path program 1 times [2022-11-21 13:49:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:44,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203043527] [2022-11-21 13:49:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:49:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:49:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:49:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203043527] [2022-11-21 13:49:44,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203043527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:44,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536408431] [2022-11-21 13:49:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:44,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:44,799 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:44,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-21 13:49:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:45,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:49:45,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:45,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:49:45,358 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5117 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5117))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-21 13:49:45,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:49:45,550 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5118 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5118))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-21 13:49:45,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:49:45,806 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5119 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5119))))) is different from true [2022-11-21 13:49:45,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 13:49:45,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:49:46,097 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:49:46,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:49:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-21 13:49:46,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:49:48,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536408431] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:49:48,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:49:48,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2022-11-21 13:49:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250968891] [2022-11-21 13:49:48,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:49:48,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 13:49:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:48,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 13:49:48,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-11-21 13:49:48,268 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 13:49:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:49,476 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-21 13:49:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:49:49,476 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2022-11-21 13:49:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:49,477 INFO L225 Difference]: With dead ends: 82 [2022-11-21 13:49:49,477 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 13:49:49,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=104, Invalid=247, Unknown=3, NotChecked=108, Total=462 [2022-11-21 13:49:49,478 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 327 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:49,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 246 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 209 Invalid, 0 Unknown, 231 Unchecked, 0.9s Time] [2022-11-21 13:49:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 13:49:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-21 13:49:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:49:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-21 13:49:49,482 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 58 [2022-11-21 13:49:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:49,482 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-21 13:49:49,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 13:49:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-21 13:49:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 13:49:49,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:49,483 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:49,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-21 13:49:49,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:49,690 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:49:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:49,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1796531691, now seen corresponding path program 1 times [2022-11-21 13:49:49,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:49,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439812523] [2022-11-21 13:49:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:59,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:49:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:50:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:50:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:03,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439812523] [2022-11-21 13:50:03,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439812523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:03,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197935726] [2022-11-21 13:50:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:03,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:50:03,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:50:03,345 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:50:03,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-21 13:50:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:03,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 159 conjunts are in the unsatisfiable core [2022-11-21 13:50:03,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:03,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:50:04,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:50:05,394 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:50:05,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:50:06,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:50:07,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:50:08,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:08,129 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:50:08,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-21 13:50:09,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:50:09,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-21 13:50:10,222 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:50:10,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2022-11-21 13:50:10,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:50:11,686 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:50:11,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2022-11-21 13:50:11,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:50:12,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:12,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 13:50:12,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:12,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-21 13:50:13,818 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:50:13,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2022-11-21 13:50:13,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:13,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-21 13:50:13,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:50:13,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:50:17,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:17,242 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:50:17,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 65 [2022-11-21 13:50:17,345 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 13:50:17,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-21 13:50:17,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:50:17,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:17,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:17,521 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 13:50:17,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:50:17,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:17,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:50:23,266 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:50:23,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 94 [2022-11-21 13:50:23,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-11-21 13:50:23,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:23,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-21 13:50:23,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-21 13:50:24,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:24,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-21 13:50:24,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:50:24,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:24,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:50:24,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:24,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-21 13:50:24,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:50:24,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:24,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:50:24,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-21 13:50:25,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:50:25,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:50:25,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 13:50:25,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:50:26,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:50:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:50:27,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:29,015 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5444) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5445) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5442) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5443) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-21 13:51:35,253 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5438 Int) (v_ArrVal_5460 (Array Int Int)) (v_ArrVal_5462 (Array Int Int)) (v_ArrVal_5461 (Array Int Int)) (v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5462)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5461))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5460))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_5438))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5444) .cse3 v_ArrVal_5445) (select (select (store (store (store .cse4 .cse1 v_ArrVal_5436) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5442) .cse3 v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store .cse5 .cse1 v_ArrVal_5437) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5443) .cse3 v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31|))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| |c_#StackHeapBarrier|)))) is different from false [2022-11-21 13:51:35,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197935726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:35,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:51:35,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 72 [2022-11-21 13:51:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628454116] [2022-11-21 13:51:35,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:35,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-21 13:51:35,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:35,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-21 13:51:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=6046, Unknown=314, NotChecked=322, Total=6972 [2022-11-21 13:51:35,263 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 13:52:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:19,537 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-11-21 13:52:19,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 13:52:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-11-21 13:52:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:19,539 INFO L225 Difference]: With dead ends: 101 [2022-11-21 13:52:19,539 INFO L226 Difference]: Without dead ends: 101 [2022-11-21 13:52:19,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 125.1s TimeCoverageRelationStatistics Valid=764, Invalid=10053, Unknown=321, NotChecked=418, Total=11556 [2022-11-21 13:52:19,541 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 844 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 80 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:19,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1201 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2428 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2022-11-21 13:52:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-21 13:52:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2022-11-21 13:52:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:52:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-21 13:52:19,544 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 59 [2022-11-21 13:52:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:19,545 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-21 13:52:19,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 13:52:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-21 13:52:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-21 13:52:19,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:19,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:19,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:19,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:52:19,755 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:52:19,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:19,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535007, now seen corresponding path program 1 times [2022-11-21 13:52:19,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:52:19,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331149048] [2022-11-21 13:52:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:52:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:52:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:27,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:52:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:52:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:52:30,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:52:30,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331149048] [2022-11-21 13:52:30,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331149048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:52:30,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088185673] [2022-11-21 13:52:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:30,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:52:30,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:52:30,808 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:52:30,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-21 13:52:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:31,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-21 13:52:31,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:31,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:52:31,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:52:32,498 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:52:32,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:52:33,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:52:34,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:34,560 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:52:34,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-21 13:52:35,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:52:36,418 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:52:36,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-21 13:52:37,758 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:52:37,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:52:38,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:38,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-21 13:52:39,575 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:52:39,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-11-21 13:52:39,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:39,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-21 13:52:39,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:52:42,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:42,611 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:52:42,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 56 [2022-11-21 13:52:42,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:42,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:42,842 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-21 13:52:42,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2022-11-21 13:52:42,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:42,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:52:48,597 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-21 13:52:48,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 72 [2022-11-21 13:52:48,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:48,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:52:49,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:49,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:52:49,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:49,508 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:52:49,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 52 [2022-11-21 13:52:49,704 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 13:52:49,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 82 [2022-11-21 13:52:49,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:49,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-21 13:52:50,505 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:52:50,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 69 [2022-11-21 13:52:50,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:52:51,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:52:52,995 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:52:52,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 39 [2022-11-21 13:52:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:52:54,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:54,557 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-21 13:52:54,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-21 13:52:56,268 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-21 13:52:56,305 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) .cse1 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) .cse1 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2022-11-21 13:52:58,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) .cse2 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) .cse2 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2022-11-21 13:52:58,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse2 .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) .cse4 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) .cse4 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) 1)) is different from false [2022-11-21 13:53:01,038 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| Int) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5778 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5777 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| 1) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5777))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5778)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (select (let ((.cse0 (store (store (store .cse1 .cse2 (store .cse3 .cse4 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5764) .cse5 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse6 .cse2 v_ArrVal_5761) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5765) .cse5 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) 1))) is different from false [2022-11-21 13:53:01,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088185673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:53:01,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:53:01,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 70 [2022-11-21 13:53:01,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054724035] [2022-11-21 13:53:01,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:53:01,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-21 13:53:01,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:53:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-21 13:53:01,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=4993, Unknown=166, NotChecked=1050, Total=6480 [2022-11-21 13:53:01,046 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:53:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:53:32,613 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2022-11-21 13:53:32,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 13:53:32,613 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2022-11-21 13:53:32,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:53:32,615 INFO L225 Difference]: With dead ends: 139 [2022-11-21 13:53:32,615 INFO L226 Difference]: Without dead ends: 139 [2022-11-21 13:53:32,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 49.7s TimeCoverageRelationStatistics Valid=679, Invalid=7734, Unknown=171, NotChecked=1316, Total=9900 [2022-11-21 13:53:32,617 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1329 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 86 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:53:32,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 940 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2267 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2022-11-21 13:53:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-21 13:53:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2022-11-21 13:53:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:53:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-11-21 13:53:32,621 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 63 [2022-11-21 13:53:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:53:32,621 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-11-21 13:53:32,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:53:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-11-21 13:53:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-21 13:53:32,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:53:32,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:53:32,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-21 13:53:32,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-21 13:53:32,827 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:53:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:53:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535006, now seen corresponding path program 1 times [2022-11-21 13:53:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:53:32,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963375568] [2022-11-21 13:53:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:53:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:53:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:53:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:53:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:53:41,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:53:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:53:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:53:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:53:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:53:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:53:46,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963375568] [2022-11-21 13:53:46,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963375568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:53:46,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814490338] [2022-11-21 13:53:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:53:46,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:53:46,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:53:46,800 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:53:46,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-21 13:53:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:53:47,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-21 13:53:47,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:53:47,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:53:47,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:53:48,559 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:53:48,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:53:49,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:53:50,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:53:50,727 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:53:50,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-21 13:53:51,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:53:52,740 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:53:52,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-21 13:53:54,116 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:53:54,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:53:54,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:53:54,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-21 13:53:55,959 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:53:55,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-11-21 13:53:55,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:53:55,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-21 13:53:55,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:53:59,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:53:59,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:53:59,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:53:59,166 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:53:59,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 56 [2022-11-21 13:53:59,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:53:59,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:53:59,326 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 13:53:59,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:54:04,853 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-21 13:54:04,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 71 [2022-11-21 13:54:04,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:04,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-21 13:54:05,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:05,760 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:54:05,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 54 [2022-11-21 13:54:05,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:05,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:05,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-21 13:54:06,042 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 13:54:06,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 92 [2022-11-21 13:54:06,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:06,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:06,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2022-11-21 13:54:06,885 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:54:06,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 79 [2022-11-21 13:54:06,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:06,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-11-21 13:54:09,318 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-21 13:54:09,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 53 [2022-11-21 13:54:09,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:54:09,362 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:54:09,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2022-11-21 13:54:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:54:10,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:54:13,621 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6083 (Array Int Int)) (v_ArrVal_6082 (Array Int Int))) (<= 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6082))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6083) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 8))) (forall ((v_ArrVal_6083 (Array Int Int)) (v_ArrVal_6082 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6082)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6083))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse3) 12) (select |c_#length| (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-21 13:54:22,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:22,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 637 [2022-11-21 13:54:26,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814490338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:54:26,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:54:26,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 71 [2022-11-21 13:54:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826764254] [2022-11-21 13:54:26,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:54:26,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-21 13:54:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:54:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-21 13:54:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=7016, Unknown=21, NotChecked=168, Total=7482 [2022-11-21 13:54:26,353 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:55:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:07,426 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-11-21 13:55:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 13:55:07,427 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2022-11-21 13:55:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:07,427 INFO L225 Difference]: With dead ends: 155 [2022-11-21 13:55:07,427 INFO L226 Difference]: Without dead ends: 155 [2022-11-21 13:55:07,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 67.7s TimeCoverageRelationStatistics Valid=748, Invalid=10577, Unknown=21, NotChecked=210, Total=11556 [2022-11-21 13:55:07,430 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1772 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 77 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:07,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1772 Valid, 1070 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2714 Invalid, 2 Unknown, 0 Unchecked, 14.8s Time] [2022-11-21 13:55:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-21 13:55:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 88. [2022-11-21 13:55:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:55:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-21 13:55:07,434 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 63 [2022-11-21 13:55:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:07,434 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-21 13:55:07,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:55:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-21 13:55:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-21 13:55:07,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:07,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:07,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:07,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:07,643 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:55:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1257988692, now seen corresponding path program 1 times [2022-11-21 13:55:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:07,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558563908] [2022-11-21 13:55:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:17,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:55:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:55:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 13:55:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:55:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:24,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558563908] [2022-11-21 13:55:24,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558563908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:55:24,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526482212] [2022-11-21 13:55:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:24,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:24,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:24,096 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:24,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-21 13:55:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:24,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-21 13:55:24,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:24,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:55:24,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:55:26,250 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:55:26,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:55:27,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:55:28,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:28,506 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:55:28,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-21 13:55:29,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:55:30,624 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:55:30,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-21 13:55:32,039 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:55:32,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:55:32,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:32,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-21 13:55:34,098 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:55:34,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-11-21 13:55:34,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:55:34,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:34,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-21 13:55:37,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:37,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:55:37,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:37,388 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:55:37,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 56 [2022-11-21 13:55:37,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:37,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:37,525 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 13:55:37,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:55:43,008 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-21 13:55:43,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 62 [2022-11-21 13:55:43,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:43,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-21 13:55:43,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:43,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:55:43,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:43,866 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:55:43,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2022-11-21 13:55:44,024 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 13:55:44,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 68 [2022-11-21 13:55:44,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:44,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-21 13:55:44,806 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 13:55:44,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 55 [2022-11-21 13:55:44,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:55:45,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:55:48,211 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:55:48,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-21 13:55:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:55:48,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:49,358 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6397))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-21 13:55:50,754 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-21 13:55:53,405 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) .cse2 v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) .cse2 v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2022-11-21 13:55:53,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse4 .cse5))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) .cse3 v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) .cse3 v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2022-11-21 13:55:53,471 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse4 .cse5))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6394) .cse3 v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6395) .cse3 v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2022-11-21 13:55:54,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526482212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:55:54,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:54,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 73 [2022-11-21 13:55:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575612313] [2022-11-21 13:55:54,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:54,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-21 13:55:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-21 13:55:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=5575, Unknown=205, NotChecked=780, Total=6806 [2022-11-21 13:55:54,589 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 73 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 64 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 13:56:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:42,344 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-11-21 13:56:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 13:56:42,345 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 64 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-11-21 13:56:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:56:42,345 INFO L225 Difference]: With dead ends: 109 [2022-11-21 13:56:42,345 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 13:56:42,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2047 ImplicationChecksByTransitivity, 67.8s TimeCoverageRelationStatistics Valid=735, Invalid=9774, Unknown=223, NotChecked=1040, Total=11772 [2022-11-21 13:56:42,346 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 869 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 75 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:56:42,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1185 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2883 Invalid, 1 Unknown, 0 Unchecked, 15.3s Time] [2022-11-21 13:56:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 13:56:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2022-11-21 13:56:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:56:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-21 13:56:42,351 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 64 [2022-11-21 13:56:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:56:42,351 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-21 13:56:42,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 64 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 13:56:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-21 13:56:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 13:56:42,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:42,353 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:42,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-21 13:56:42,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f82c8c-0b91-4a7a-ba18-56d3ba180afb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-21 13:56:42,560 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-21 13:56:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 342976484, now seen corresponding path program 1 times [2022-11-21 13:56:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:42,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074509100] [2022-11-21 13:56:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat