./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f 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_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8 --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 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab --- 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-e04fb08 [2022-11-16 11:48:45,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:48:45,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:48:45,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:48:45,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:48:45,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:48:45,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:48:45,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:48:45,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:48:45,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:48:45,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:48:45,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:48:45,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:48:45,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:48:45,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:48:45,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:48:45,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:48:45,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:48:45,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:48:45,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:48:45,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:48:45,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:48:45,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:48:45,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:48:45,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:48:45,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:48:45,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:48:45,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:48:45,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:48:45,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:48:45,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:48:45,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:48:45,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:48:45,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:48:45,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:48:45,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:48:45,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:48:45,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:48:45,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:48:45,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:48:45,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:48:45,302 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:48:45,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:48:45,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:48:45,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:48:45,332 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:48:45,333 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:48:45,333 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:48:45,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:48:45,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:48:45,334 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:48:45,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:48:45,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:48:45,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:48:45,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:48:45,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:48:45,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:48:45,337 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:48:45,337 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:48:45,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:48:45,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:48:45,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:48:45,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:48:45,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:48:45,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:48:45,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:48:45,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:48:45,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:48:45,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:48:45,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:48:45,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:48:45,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:48:45,343 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_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/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_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8 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 -> 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab [2022-11-16 11:48:45,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:48:45,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:48:45,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:48:45,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:48:45,626 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:48:45,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2022-11-16 11:48:45,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/data/2748c6806/2d408ca2d08145f29588d6aac0d060fd/FLAG8cc1f27b9 [2022-11-16 11:48:46,177 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:48:46,178 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2022-11-16 11:48:46,199 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/data/2748c6806/2d408ca2d08145f29588d6aac0d060fd/FLAG8cc1f27b9 [2022-11-16 11:48:46,534 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/data/2748c6806/2d408ca2d08145f29588d6aac0d060fd [2022-11-16 11:48:46,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:48:46,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:48:46,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:48:46,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:48:46,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:48:46,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:48:46" (1/1) ... [2022-11-16 11:48:46,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b8d8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:46, skipping insertion in model container [2022-11-16 11:48:46,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:48:46" (1/1) ... [2022-11-16 11:48:46,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:48:46,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:48:47,038 WARN L229 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_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/sv-benchmarks/c/list-ext-properties/list-ext_flag.i[23527,23540] [2022-11-16 11:48:47,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:48:47,059 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:48:47,118 WARN L229 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_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/sv-benchmarks/c/list-ext-properties/list-ext_flag.i[23527,23540] [2022-11-16 11:48:47,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:48:47,149 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:48:47,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47 WrapperNode [2022-11-16 11:48:47,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:48:47,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:48:47,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:48:47,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:48:47,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,211 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2022-11-16 11:48:47,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:48:47,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:48:47,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:48:47,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:48:47,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,238 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:48:47,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:48:47,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:48:47,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:48:47,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (1/1) ... [2022-11-16 11:48:47,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:48:47,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:47,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:48:47,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:48:47,342 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-16 11:48:47,343 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-16 11:48:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:48:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:48:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:48:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:48:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:48:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:48:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:48:47,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:48:47,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:48:47,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:48:47,441 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:48:47,443 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:48:47,481 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-16 11:48:47,852 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:48:47,859 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:48:47,860 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 11:48:47,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:48:47 BoogieIcfgContainer [2022-11-16 11:48:47,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:48:47,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:48:47,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:48:47,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:48:47,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:48:46" (1/3) ... [2022-11-16 11:48:47,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43005270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:48:47, skipping insertion in model container [2022-11-16 11:48:47,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:48:47" (2/3) ... [2022-11-16 11:48:47,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43005270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:48:47, skipping insertion in model container [2022-11-16 11:48:47,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:48:47" (3/3) ... [2022-11-16 11:48:47,884 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2022-11-16 11:48:47,902 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:48:47,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-11-16 11:48:47,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:48:47,956 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;@58c3421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:48:47,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2022-11-16 11:48:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 55 states have (on average 2.109090909090909) internal successors, (116), 102 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:48:47,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:47,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:48:47,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-11-16 11:48:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:47,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943695706] [2022-11-16 11:48:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:47,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,181 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-16 11:48:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:48,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943695706] [2022-11-16 11:48:48,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943695706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:48,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:48,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:48:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566962171] [2022-11-16 11:48:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:48,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:48:48,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:48:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:48:48,219 INFO L87 Difference]: Start difference. First operand has 104 states, 55 states have (on average 2.109090909090909) internal successors, (116), 102 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:48,359 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2022-11-16 11:48:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:48:48,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-16 11:48:48,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:48,369 INFO L225 Difference]: With dead ends: 123 [2022-11-16 11:48:48,369 INFO L226 Difference]: Without dead ends: 116 [2022-11-16 11:48:48,370 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-16 11:48:48,374 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:48,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 85 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:48:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-16 11:48:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2022-11-16 11:48:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 2.0) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-11-16 11:48:48,410 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 4 [2022-11-16 11:48:48,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:48,411 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-11-16 11:48:48,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-11-16 11:48:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:48:48,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:48,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:48:48,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:48:48,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-11-16 11:48:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:48,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674248038] [2022-11-16 11:48:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,499 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-16 11:48:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:48,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674248038] [2022-11-16 11:48:48,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674248038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:48,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:48,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:48:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306343055] [2022-11-16 11:48:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:48,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:48:48,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:48,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:48:48,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:48:48,503 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:48,570 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-11-16 11:48:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:48:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-16 11:48:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:48,572 INFO L225 Difference]: With dead ends: 95 [2022-11-16 11:48:48,572 INFO L226 Difference]: Without dead ends: 95 [2022-11-16 11:48:48,572 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-16 11:48:48,574 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:48,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 65 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:48:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-16 11:48:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-16 11:48:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 94 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-11-16 11:48:48,584 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 4 [2022-11-16 11:48:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:48,585 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-11-16 11:48:48,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-11-16 11:48:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:48:48,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:48,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:48,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:48:48,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:48,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304377, now seen corresponding path program 1 times [2022-11-16 11:48:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:48,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441233474] [2022-11-16 11:48:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,724 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-16 11:48:48,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:48,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441233474] [2022-11-16 11:48:48,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441233474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:48,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:48,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:48:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031205859] [2022-11-16 11:48:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:48,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:48:48,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:48,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:48:48,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:48:48,727 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:48,904 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-11-16 11:48:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:48:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 11:48:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:48,910 INFO L225 Difference]: With dead ends: 105 [2022-11-16 11:48:48,910 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 11:48:48,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:48:48,917 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 168 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:48,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 52 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:48:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 11:48:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-11-16 11:48:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-11-16 11:48:48,923 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 9 [2022-11-16 11:48:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:48,924 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-11-16 11:48:48,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-11-16 11:48:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:48:48,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:48,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:48,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:48:48,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304378, now seen corresponding path program 1 times [2022-11-16 11:48:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:48,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652151385] [2022-11-16 11:48:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:49,141 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-16 11:48:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:49,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652151385] [2022-11-16 11:48:49,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652151385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:49,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:49,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:48:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008816487] [2022-11-16 11:48:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:49,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:48:49,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:49,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:48:49,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:48:49,150 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:49,348 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-11-16 11:48:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:48:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 11:48:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:49,350 INFO L225 Difference]: With dead ends: 123 [2022-11-16 11:48:49,351 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 11:48:49,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:48:49,361 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 180 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:49,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:48:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 11:48:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2022-11-16 11:48:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2022-11-16 11:48:49,388 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 9 [2022-11-16 11:48:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:49,389 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2022-11-16 11:48:49,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2022-11-16 11:48:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:48:49,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:49,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:49,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:48:49,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash 990774777, now seen corresponding path program 1 times [2022-11-16 11:48:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:49,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568733141] [2022-11-16 11:48:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:49,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:49,598 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-16 11:48:49,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:49,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568733141] [2022-11-16 11:48:49,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568733141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:49,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:49,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:48:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422229377] [2022-11-16 11:48:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:49,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:48:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:48:49,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:48:49,607 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:49,778 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2022-11-16 11:48:49,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:48:49,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 11:48:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:49,781 INFO L225 Difference]: With dead ends: 156 [2022-11-16 11:48:49,781 INFO L226 Difference]: Without dead ends: 156 [2022-11-16 11:48:49,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:48:49,782 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:49,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 250 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:48:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-16 11:48:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2022-11-16 11:48:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 112 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-11-16 11:48:49,789 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 15 [2022-11-16 11:48:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:49,790 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-11-16 11:48:49,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-11-16 11:48:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:48:49,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:49,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:49,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:48:49,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1321200184, now seen corresponding path program 1 times [2022-11-16 11:48:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:49,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616996593] [2022-11-16 11:48:49,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:49,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:49,937 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-16 11:48:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:49,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616996593] [2022-11-16 11:48:49,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616996593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:49,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:49,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:48:49,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186313302] [2022-11-16 11:48:49,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:49,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:48:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:48:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:48:49,940 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:50,197 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2022-11-16 11:48:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:48:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 11:48:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:50,199 INFO L225 Difference]: With dead ends: 169 [2022-11-16 11:48:50,199 INFO L226 Difference]: Without dead ends: 169 [2022-11-16 11:48:50,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:48:50,200 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 145 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:50,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 221 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:48:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-16 11:48:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2022-11-16 11:48:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2022-11-16 11:48:50,206 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 17 [2022-11-16 11:48:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:50,206 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2022-11-16 11:48:50,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2022-11-16 11:48:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:48:50,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:50,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:50,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:48:50,208 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:50,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1496225836, now seen corresponding path program 1 times [2022-11-16 11:48:50,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:50,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401344221] [2022-11-16 11:48:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:50,277 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-16 11:48:50,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:50,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401344221] [2022-11-16 11:48:50,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401344221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:50,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:50,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:48:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696438755] [2022-11-16 11:48:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:50,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:48:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:50,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:48:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:48:50,281 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:50,398 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2022-11-16 11:48:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:48:50,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:48:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:50,400 INFO L225 Difference]: With dead ends: 122 [2022-11-16 11:48:50,400 INFO L226 Difference]: Without dead ends: 122 [2022-11-16 11:48:50,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:48:50,401 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 157 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:50,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 84 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:48:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-16 11:48:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2022-11-16 11:48:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 113 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2022-11-16 11:48:50,406 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 19 [2022-11-16 11:48:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:50,406 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2022-11-16 11:48:50,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2022-11-16 11:48:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:48:50,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:50,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:50,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:48:50,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:50,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash 893457289, now seen corresponding path program 1 times [2022-11-16 11:48:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:50,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155378362] [2022-11-16 11:48:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:50,579 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-16 11:48:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:50,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155378362] [2022-11-16 11:48:50,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155378362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:50,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:50,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:48:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148547808] [2022-11-16 11:48:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:50,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:48:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:50,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:48:50,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:48:50,582 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:50,751 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2022-11-16 11:48:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:48:50,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 11:48:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:50,753 INFO L225 Difference]: With dead ends: 151 [2022-11-16 11:48:50,753 INFO L226 Difference]: Without dead ends: 141 [2022-11-16 11:48:50,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:48:50,754 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 85 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:50,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 201 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:48:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-16 11:48:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2022-11-16 11:48:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2022-11-16 11:48:50,758 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 22 [2022-11-16 11:48:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:50,759 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2022-11-16 11:48:50,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-11-16 11:48:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:48:50,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:50,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:50,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:48:50,760 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608044, now seen corresponding path program 1 times [2022-11-16 11:48:50,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:50,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912472632] [2022-11-16 11:48:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912472632] [2022-11-16 11:48:50,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912472632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:50,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:50,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:48:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223443935] [2022-11-16 11:48:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:50,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:48:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:50,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:48:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:48:50,927 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:51,125 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-11-16 11:48:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:48:51,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 11:48:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:51,126 INFO L225 Difference]: With dead ends: 120 [2022-11-16 11:48:51,126 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 11:48:51,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:48:51,129 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 119 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:51,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 185 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:48:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 11:48:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-11-16 11:48:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 116 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2022-11-16 11:48:51,134 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 22 [2022-11-16 11:48:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:51,134 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-11-16 11:48:51,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-11-16 11:48:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:48:51,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:51,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:51,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:48:51,140 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608043, now seen corresponding path program 1 times [2022-11-16 11:48:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:51,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394664840] [2022-11-16 11:48:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394664840] [2022-11-16 11:48:51,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394664840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:51,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:51,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:48:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922096083] [2022-11-16 11:48:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:51,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:48:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:48:51,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:48:51,528 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:51,812 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-11-16 11:48:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:48:51,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 11:48:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:51,814 INFO L225 Difference]: With dead ends: 117 [2022-11-16 11:48:51,814 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 11:48:51,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:48:51,815 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:51,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 253 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:48:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 11:48:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2022-11-16 11:48:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.369047619047619) internal successors, (115), 99 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2022-11-16 11:48:51,818 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 22 [2022-11-16 11:48:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:51,819 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2022-11-16 11:48:51,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2022-11-16 11:48:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:48:51,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:51,820 INFO L195 NwaCegarLoop]: trace histogram [1, 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-16 11:48:51,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:48:51,820 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1076428849, now seen corresponding path program 1 times [2022-11-16 11:48:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:51,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781858372] [2022-11-16 11:48:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:48:52,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:52,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781858372] [2022-11-16 11:48:52,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781858372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:52,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:52,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:48:52,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259429502] [2022-11-16 11:48:52,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:52,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:48:52,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:52,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:48:52,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:48:52,160 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:52,426 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2022-11-16 11:48:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:48:52,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-16 11:48:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:52,428 INFO L225 Difference]: With dead ends: 107 [2022-11-16 11:48:52,428 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 11:48:52,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:48:52,429 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 117 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:52,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 294 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:48:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 11:48:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-11-16 11:48:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2022-11-16 11:48:52,432 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 25 [2022-11-16 11:48:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:52,432 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2022-11-16 11:48:52,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-11-16 11:48:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:48:52,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:52,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:52,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:48:52,433 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:52,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash 762143636, now seen corresponding path program 1 times [2022-11-16 11:48:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:52,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388988630] [2022-11-16 11:48:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:52,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388988630] [2022-11-16 11:48:52,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388988630] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004370314] [2022-11-16 11:48:52,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:52,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:52,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:52,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:52,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:48:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:52,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:48:52,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:52,792 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-16 11:48:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:48:52,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:48:52,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004370314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:52,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:48:52,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-11-16 11:48:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192934977] [2022-11-16 11:48:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:52,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:48:52,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:52,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:48:52,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:48:52,808 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:52,983 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2022-11-16 11:48:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:48:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-16 11:48:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:52,985 INFO L225 Difference]: With dead ends: 140 [2022-11-16 11:48:52,985 INFO L226 Difference]: Without dead ends: 140 [2022-11-16 11:48:52,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:48:52,986 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 45 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:52,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 301 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:48:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-16 11:48:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2022-11-16 11:48:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3875) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-11-16 11:48:52,989 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 28 [2022-11-16 11:48:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:52,989 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-11-16 11:48:52,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-11-16 11:48:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:48:52,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:52,990 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:53,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:53,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 11:48:53,197 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1442202006, now seen corresponding path program 1 times [2022-11-16 11:48:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:53,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580423432] [2022-11-16 11:48:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:53,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:53,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580423432] [2022-11-16 11:48:53,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580423432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:53,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894255169] [2022-11-16 11:48:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:53,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:53,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:48:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:53,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:48:53,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:53,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:53,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894255169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:48:53,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:48:53,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-11-16 11:48:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647243481] [2022-11-16 11:48:53,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:48:53,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:48:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:53,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:48:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:48:53,637 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:53,830 INFO L93 Difference]: Finished difference Result 324 states and 370 transitions. [2022-11-16 11:48:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:48:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-16 11:48:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:53,832 INFO L225 Difference]: With dead ends: 324 [2022-11-16 11:48:53,832 INFO L226 Difference]: Without dead ends: 324 [2022-11-16 11:48:53,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:48:53,834 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 233 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:53,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 501 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:48:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-16 11:48:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 137. [2022-11-16 11:48:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2022-11-16 11:48:53,843 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 28 [2022-11-16 11:48:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:53,843 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2022-11-16 11:48:53,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2022-11-16 11:48:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:48:53,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:53,844 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:53,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:54,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:48:54,050 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1992394589, now seen corresponding path program 1 times [2022-11-16 11:48:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:54,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920851879] [2022-11-16 11:48:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920851879] [2022-11-16 11:48:54,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920851879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761492916] [2022-11-16 11:48:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:54,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:54,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:54,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:54,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:48:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:54,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:48:54,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:54,730 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-16 11:48:54,785 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:48:54,786 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-16 11:48:54,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:54,863 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-16 11:48:54,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:48:54,918 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 20 treesize of output 8 [2022-11-16 11:48:55,012 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-16 11:48:55,087 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-16 11:48:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:55,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:55,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-16 11:48:55,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-16 11:48:55,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:55,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-16 11:48:55,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:55,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-16 11:48:55,374 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-16 11:48:55,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:55,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-16 11:48:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:48:55,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761492916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:48:55,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:48:55,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-11-16 11:48:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453770765] [2022-11-16 11:48:55,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:48:55,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 11:48:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 11:48:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=8, NotChecked=102, Total=812 [2022-11-16 11:48:55,744 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:56,599 INFO L93 Difference]: Finished difference Result 362 states and 407 transitions. [2022-11-16 11:48:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:48:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 11:48:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:56,602 INFO L225 Difference]: With dead ends: 362 [2022-11-16 11:48:56,602 INFO L226 Difference]: Without dead ends: 362 [2022-11-16 11:48:56,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=8, NotChecked=126, Total=1190 [2022-11-16 11:48:56,603 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 449 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 811 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:56,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 933 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 850 Invalid, 0 Unknown, 811 Unchecked, 0.6s Time] [2022-11-16 11:48:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-16 11:48:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 153. [2022-11-16 11:48:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2022-11-16 11:48:56,609 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 30 [2022-11-16 11:48:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:56,610 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2022-11-16 11:48:56,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2022-11-16 11:48:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:48:56,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:56,611 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:56,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:56,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:56,817 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1992702419, now seen corresponding path program 1 times [2022-11-16 11:48:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:56,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003011722] [2022-11-16 11:48:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:57,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003011722] [2022-11-16 11:48:57,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003011722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:57,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953049724] [2022-11-16 11:48:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:57,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:57,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:57,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:57,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:48:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:57,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 11:48:57,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:57,614 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-16 11:48:57,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:57,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:48:57,687 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:48:57,688 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-16 11:48:57,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:48:57,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:48:57,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-16 11:48:57,780 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-16 11:48:57,807 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-16 11:48:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:57,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:57,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-16 11:48:57,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-16 11:48:58,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:58,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2022-11-16 11:48:58,215 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 11:48:58,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2022-11-16 11:48:58,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 11 treesize of output 7 [2022-11-16 11:48:58,232 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:48:58,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 11:48:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:48:58,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953049724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:48:58,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:48:58,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2022-11-16 11:48:58,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624915068] [2022-11-16 11:48:58,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:48:58,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:48:58,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:58,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:48:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=447, Unknown=11, NotChecked=90, Total=650 [2022-11-16 11:48:58,297 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:58,928 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2022-11-16 11:48:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:48:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 11:48:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:58,929 INFO L225 Difference]: With dead ends: 246 [2022-11-16 11:48:58,930 INFO L226 Difference]: Without dead ends: 246 [2022-11-16 11:48:58,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=615, Unknown=11, NotChecked=110, Total=930 [2022-11-16 11:48:58,931 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 543 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 607 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:58,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 624 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 520 Invalid, 0 Unknown, 607 Unchecked, 0.4s Time] [2022-11-16 11:48:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-16 11:48:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 153. [2022-11-16 11:48:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 152 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2022-11-16 11:48:58,935 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 30 [2022-11-16 11:48:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:58,936 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2022-11-16 11:48:58,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:48:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2022-11-16 11:48:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:48:58,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:58,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:58,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:59,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:59,138 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:48:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1374608061, now seen corresponding path program 1 times [2022-11-16 11:48:59,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:59,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905416852] [2022-11-16 11:48:59,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:59,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:48:59,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905416852] [2022-11-16 11:48:59,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905416852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189171170] [2022-11-16 11:48:59,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:59,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:59,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:59,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:59,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:48:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:59,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:48:59,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:59,913 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-16 11:49:00,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:00,024 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 22 treesize of output 21 [2022-11-16 11:49:00,050 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:00,050 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-16 11:49:00,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:00,110 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 24 treesize of output 23 [2022-11-16 11:49:00,148 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 20 treesize of output 8 [2022-11-16 11:49:00,222 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 17 treesize of output 19 [2022-11-16 11:49:00,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-16 11:49:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:00,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:00,563 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_62| Int)) (or (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_62| 4)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_62|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_62| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-16 11:49:01,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:01,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2022-11-16 11:49:01,098 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 11:49:01,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2022-11-16 11:49:01,104 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 22 treesize of output 18 [2022-11-16 11:49:01,113 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:49:01,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 11:49:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:01,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189171170] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:01,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:01,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 38 [2022-11-16 11:49:01,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403967886] [2022-11-16 11:49:01,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:01,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 11:49:01,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:01,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 11:49:01,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1107, Unknown=5, NotChecked=70, Total=1406 [2022-11-16 11:49:01,234 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:02,138 INFO L93 Difference]: Finished difference Result 257 states and 286 transitions. [2022-11-16 11:49:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:49:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 11:49:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:02,141 INFO L225 Difference]: With dead ends: 257 [2022-11-16 11:49:02,141 INFO L226 Difference]: Without dead ends: 257 [2022-11-16 11:49:02,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1367, Unknown=5, NotChecked=80, Total=1806 [2022-11-16 11:49:02,143 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 584 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 926 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:02,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1105 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 837 Invalid, 0 Unknown, 926 Unchecked, 0.7s Time] [2022-11-16 11:49:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-16 11:49:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 173. [2022-11-16 11:49:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 172 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2022-11-16 11:49:02,163 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 30 [2022-11-16 11:49:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:02,164 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2022-11-16 11:49:02,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2022-11-16 11:49:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:49:02,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:02,165 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:02,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:02,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:49:02,371 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1374915891, now seen corresponding path program 1 times [2022-11-16 11:49:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:02,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561199654] [2022-11-16 11:49:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:02,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561199654] [2022-11-16 11:49:02,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561199654] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:02,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684672249] [2022-11-16 11:49:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:02,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:02,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:02,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:02,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:49:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:02,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:49:02,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:02,945 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-16 11:49:02,985 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:02,985 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-16 11:49:03,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:03,074 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-16 11:49:03,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:03,133 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 20 treesize of output 8 [2022-11-16 11:49:03,211 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-16 11:49:03,278 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-16 11:49:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:03,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:03,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 11:49:03,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 11:49:03,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 11:49:03,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:03,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-16 11:49:03,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:03,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-16 11:49:03,452 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-16 11:49:03,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:03,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-16 11:49:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:49:03,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684672249] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:03,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:03,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-11-16 11:49:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763394982] [2022-11-16 11:49:03,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:03,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 11:49:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:03,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 11:49:03,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=529, Unknown=3, NotChecked=150, Total=812 [2022-11-16 11:49:03,711 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:04,452 INFO L93 Difference]: Finished difference Result 279 states and 309 transitions. [2022-11-16 11:49:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:49:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 11:49:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:04,454 INFO L225 Difference]: With dead ends: 279 [2022-11-16 11:49:04,454 INFO L226 Difference]: Without dead ends: 279 [2022-11-16 11:49:04,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=814, Unknown=3, NotChecked=192, Total=1260 [2022-11-16 11:49:04,456 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 353 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 729 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:04,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 702 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 659 Invalid, 0 Unknown, 729 Unchecked, 0.5s Time] [2022-11-16 11:49:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-16 11:49:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 181. [2022-11-16 11:49:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 165 states have (on average 1.2545454545454546) internal successors, (207), 180 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 207 transitions. [2022-11-16 11:49:04,461 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 207 transitions. Word has length 30 [2022-11-16 11:49:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:04,461 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 207 transitions. [2022-11-16 11:49:04,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 207 transitions. [2022-11-16 11:49:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:49:04,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:04,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:04,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:04,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 11:49:04,669 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash 864210937, now seen corresponding path program 1 times [2022-11-16 11:49:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:04,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357356686] [2022-11-16 11:49:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:05,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:05,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357356686] [2022-11-16 11:49:05,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357356686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:05,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060296417] [2022-11-16 11:49:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:05,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:05,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:05,154 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:05,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:49:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:05,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 11:49:05,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:05,427 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:49:05,428 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-16 11:49:05,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:05,641 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:49:05,642 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-16 11:49:05,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 11:49:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:05,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:05,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-16 11:49:05,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-16 11:49:05,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-16 11:49:05,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:05,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-16 11:49:05,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:05,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-16 11:49:05,900 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 5 [2022-11-16 11:49:10,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:10,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2022-11-16 11:49:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:49:13,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060296417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:13,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:13,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2022-11-16 11:49:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959125917] [2022-11-16 11:49:13,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:13,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 11:49:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 11:49:13,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=710, Unknown=3, NotChecked=174, Total=1056 [2022-11-16 11:49:13,162 INFO L87 Difference]: Start difference. First operand 181 states and 207 transitions. Second operand has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:16,017 INFO L93 Difference]: Finished difference Result 259 states and 289 transitions. [2022-11-16 11:49:16,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:49:16,018 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-16 11:49:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:16,019 INFO L225 Difference]: With dead ends: 259 [2022-11-16 11:49:16,019 INFO L226 Difference]: Without dead ends: 259 [2022-11-16 11:49:16,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=264, Invalid=1005, Unknown=3, NotChecked=210, Total=1482 [2022-11-16 11:49:16,020 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 616 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 702 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:16,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 527 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 636 Invalid, 0 Unknown, 702 Unchecked, 0.6s Time] [2022-11-16 11:49:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-16 11:49:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 184. [2022-11-16 11:49:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 168 states have (on average 1.255952380952381) internal successors, (211), 183 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 211 transitions. [2022-11-16 11:49:16,025 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 211 transitions. Word has length 32 [2022-11-16 11:49:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:16,025 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 211 transitions. [2022-11-16 11:49:16,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2022-11-16 11:49:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:49:16,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:16,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:16,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:16,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:49:16,232 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash 864210938, now seen corresponding path program 1 times [2022-11-16 11:49:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:16,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037056879] [2022-11-16 11:49:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:16,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037056879] [2022-11-16 11:49:16,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037056879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:16,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80824042] [2022-11-16 11:49:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:16,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:16,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:16,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:49:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:16,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 11:49:16,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:17,117 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-16 11:49:17,130 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:17,130 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-16 11:49:17,195 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-16 11:49:17,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:17,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:49:17,395 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 45 [2022-11-16 11:49:17,404 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 22 treesize of output 24 [2022-11-16 11:49:17,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 11:49:17,582 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-16 11:49:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:17,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:18,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:18,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-16 11:49:18,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:18,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-16 11:49:18,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:18,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 61 [2022-11-16 11:49:18,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:18,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2022-11-16 11:49:18,228 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 74 treesize of output 66 [2022-11-16 11:49:18,234 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 36 treesize of output 28 [2022-11-16 11:49:18,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:18,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 11:49:18,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:18,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:18,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-16 11:49:18,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:18,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-16 11:49:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:18,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80824042] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:18,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:18,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2022-11-16 11:49:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253770756] [2022-11-16 11:49:18,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:18,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 11:49:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 11:49:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1004, Unknown=28, NotChecked=0, Total=1190 [2022-11-16 11:49:18,740 INFO L87 Difference]: Start difference. First operand 184 states and 211 transitions. Second operand has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:19,532 INFO L93 Difference]: Finished difference Result 197 states and 227 transitions. [2022-11-16 11:49:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:49:19,533 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-16 11:49:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:19,534 INFO L225 Difference]: With dead ends: 197 [2022-11-16 11:49:19,534 INFO L226 Difference]: Without dead ends: 197 [2022-11-16 11:49:19,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=266, Invalid=1682, Unknown=32, NotChecked=0, Total=1980 [2022-11-16 11:49:19,535 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 106 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:19,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 748 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 310 Invalid, 0 Unknown, 180 Unchecked, 0.3s Time] [2022-11-16 11:49:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-16 11:49:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2022-11-16 11:49:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 178 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2022-11-16 11:49:19,539 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 32 [2022-11-16 11:49:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:19,539 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2022-11-16 11:49:19,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2022-11-16 11:49:19,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 11:49:19,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:19,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:19,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:19,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:19,742 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1554334094, now seen corresponding path program 1 times [2022-11-16 11:49:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:19,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019714052] [2022-11-16 11:49:19,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:20,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019714052] [2022-11-16 11:49:20,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019714052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:20,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396306195] [2022-11-16 11:49:20,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:20,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:20,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:20,122 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:20,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:49:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:20,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:49:20,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:20,428 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:20,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:49:20,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:20,683 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:49:20,683 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 33 treesize of output 34 [2022-11-16 11:49:20,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:20,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2022-11-16 11:49:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:20,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:21,239 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-11-16 11:49:21,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_87| Int)) (or (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_87|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_87| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_808) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_87| 8)) 0)))) is different from false [2022-11-16 11:49:21,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:21,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 11:49:21,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:21,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-11-16 11:49:21,282 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 22 treesize of output 18 [2022-11-16 11:49:21,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:21,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2022-11-16 11:49:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:21,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396306195] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:21,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:21,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-11-16 11:49:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473543136] [2022-11-16 11:49:21,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:21,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 11:49:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:21,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 11:49:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=770, Unknown=7, NotChecked=114, Total=992 [2022-11-16 11:49:21,756 INFO L87 Difference]: Start difference. First operand 179 states and 205 transitions. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:22,646 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2022-11-16 11:49:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:49:22,647 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 11:49:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:22,647 INFO L225 Difference]: With dead ends: 204 [2022-11-16 11:49:22,647 INFO L226 Difference]: Without dead ends: 204 [2022-11-16 11:49:22,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=240, Invalid=1401, Unknown=7, NotChecked=158, Total=1806 [2022-11-16 11:49:22,649 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 159 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:22,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 908 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 559 Invalid, 0 Unknown, 403 Unchecked, 0.4s Time] [2022-11-16 11:49:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-16 11:49:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 179. [2022-11-16 11:49:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 166 states have (on average 1.2289156626506024) internal successors, (204), 178 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2022-11-16 11:49:22,653 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 35 [2022-11-16 11:49:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:22,654 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2022-11-16 11:49:22,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2022-11-16 11:49:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 11:49:22,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:22,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:22,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:22,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:22,860 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash -39487250, now seen corresponding path program 1 times [2022-11-16 11:49:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:22,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620564542] [2022-11-16 11:49:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:23,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620564542] [2022-11-16 11:49:23,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620564542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:23,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579960389] [2022-11-16 11:49:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:23,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:23,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:23,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:23,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:49:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:23,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:49:23,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:23,516 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:23,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:49:23,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:23,742 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:49:23,742 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 33 treesize of output 34 [2022-11-16 11:49:23,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:23,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2022-11-16 11:49:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:23,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:24,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_881) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-16 11:49:24,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_98| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_881) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_98| 8)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_98| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_98|))) is different from false [2022-11-16 11:49:24,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:24,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 11:49:24,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:24,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-11-16 11:49:24,302 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 22 treesize of output 18 [2022-11-16 11:49:24,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:24,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2022-11-16 11:49:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:24,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579960389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:24,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:24,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-11-16 11:49:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081528848] [2022-11-16 11:49:24,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:24,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 11:49:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 11:49:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=772, Unknown=5, NotChecked=114, Total=992 [2022-11-16 11:49:24,792 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:25,771 INFO L93 Difference]: Finished difference Result 204 states and 227 transitions. [2022-11-16 11:49:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:49:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 11:49:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:25,773 INFO L225 Difference]: With dead ends: 204 [2022-11-16 11:49:25,773 INFO L226 Difference]: Without dead ends: 204 [2022-11-16 11:49:25,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=322, Invalid=1661, Unknown=5, NotChecked=174, Total=2162 [2022-11-16 11:49:25,774 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 173 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:25,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 792 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 419 Invalid, 0 Unknown, 391 Unchecked, 0.3s Time] [2022-11-16 11:49:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-16 11:49:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 179. [2022-11-16 11:49:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 166 states have (on average 1.2228915662650603) internal successors, (203), 178 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2022-11-16 11:49:25,779 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 35 [2022-11-16 11:49:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:25,779 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2022-11-16 11:49:25,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2022-11-16 11:49:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:49:25,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:25,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:25,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:25,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:25,985 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:25,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:25,985 INFO L85 PathProgramCache]: Analyzing trace with hash 357730772, now seen corresponding path program 1 times [2022-11-16 11:49:25,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:25,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699574068] [2022-11-16 11:49:25,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:25,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:49:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:26,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699574068] [2022-11-16 11:49:26,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699574068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:26,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444273847] [2022-11-16 11:49:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:26,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:26,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:26,113 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:26,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:49:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:26,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:49:26,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:26,371 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-16 11:49:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:26,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:26,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444273847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:26,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:26,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-16 11:49:26,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132248070] [2022-11-16 11:49:26,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:26,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:49:26,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:26,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:49:26,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:49:26,484 INFO L87 Difference]: Start difference. First operand 179 states and 203 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:26,800 INFO L93 Difference]: Finished difference Result 394 states and 449 transitions. [2022-11-16 11:49:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:49:26,803 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-16 11:49:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:26,805 INFO L225 Difference]: With dead ends: 394 [2022-11-16 11:49:26,805 INFO L226 Difference]: Without dead ends: 394 [2022-11-16 11:49:26,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2022-11-16 11:49:26,806 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 400 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:26,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 508 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:49:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-16 11:49:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 245. [2022-11-16 11:49:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 232 states have (on average 1.3017241379310345) internal successors, (302), 244 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 302 transitions. [2022-11-16 11:49:26,814 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 302 transitions. Word has length 36 [2022-11-16 11:49:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:26,815 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 302 transitions. [2022-11-16 11:49:26,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 302 transitions. [2022-11-16 11:49:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 11:49:26,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:26,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:26,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:27,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 11:49:27,021 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash 208867043, now seen corresponding path program 1 times [2022-11-16 11:49:27,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:27,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433838266] [2022-11-16 11:49:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:27,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:27,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433838266] [2022-11-16 11:49:27,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433838266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:27,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381297132] [2022-11-16 11:49:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:27,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:27,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:27,601 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:27,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:49:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:27,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 11:49:27,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:27,837 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:27,837 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-16 11:49:27,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:27,868 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-16 11:49:27,941 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:49:27,942 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 64 treesize of output 61 [2022-11-16 11:49:27,946 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 42 treesize of output 44 [2022-11-16 11:49:27,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 11:49:28,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:28,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-16 11:49:28,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:28,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2022-11-16 11:49:28,119 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-16 11:49:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:28,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:28,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2022-11-16 11:49:34,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:34,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 11:49:34,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:34,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:49:34,980 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 11 treesize of output 7 [2022-11-16 11:49:35,023 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 11:49:35,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-16 11:49:35,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:35,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-16 11:49:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:35,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381297132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:35,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:35,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 27 [2022-11-16 11:49:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513212732] [2022-11-16 11:49:35,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:35,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 11:49:35,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:35,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 11:49:35,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=601, Unknown=7, NotChecked=0, Total=702 [2022-11-16 11:49:35,704 INFO L87 Difference]: Start difference. First operand 245 states and 302 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:36,649 INFO L93 Difference]: Finished difference Result 302 states and 358 transitions. [2022-11-16 11:49:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:49:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-16 11:49:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:36,657 INFO L225 Difference]: With dead ends: 302 [2022-11-16 11:49:36,657 INFO L226 Difference]: Without dead ends: 302 [2022-11-16 11:49:36,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=226, Invalid=1099, Unknown=7, NotChecked=0, Total=1332 [2022-11-16 11:49:36,658 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 576 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:36,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 582 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 532 Invalid, 0 Unknown, 422 Unchecked, 0.5s Time] [2022-11-16 11:49:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-16 11:49:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2022-11-16 11:49:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2022-11-16 11:49:36,665 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 38 [2022-11-16 11:49:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:36,665 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2022-11-16 11:49:36,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2022-11-16 11:49:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:49:36,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:36,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:36,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:36,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:36,871 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:36,871 INFO L85 PathProgramCache]: Analyzing trace with hash 504664910, now seen corresponding path program 1 times [2022-11-16 11:49:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:36,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550198273] [2022-11-16 11:49:36,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:36,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:37,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550198273] [2022-11-16 11:49:37,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550198273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:37,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196793884] [2022-11-16 11:49:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:37,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:37,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:37,381 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:37,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:49:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:37,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 11:49:37,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:37,658 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:37,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:49:37,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:37,856 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:49:37,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 11:49:37,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:37,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2022-11-16 11:49:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:49:38,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:38,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1098 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2022-11-16 11:49:38,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1098 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1098) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2022-11-16 11:49:38,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:38,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-16 11:49:38,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:38,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-16 11:49:38,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-16 11:49:38,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:38,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2022-11-16 11:49:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-16 11:49:38,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196793884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:38,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:38,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-11-16 11:49:38,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451854957] [2022-11-16 11:49:38,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:38,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-16 11:49:38,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:38,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-16 11:49:38,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=723, Unknown=5, NotChecked=110, Total=930 [2022-11-16 11:49:38,600 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:40,551 INFO L93 Difference]: Finished difference Result 379 states and 448 transitions. [2022-11-16 11:49:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 11:49:40,556 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 11:49:40,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:40,558 INFO L225 Difference]: With dead ends: 379 [2022-11-16 11:49:40,559 INFO L226 Difference]: Without dead ends: 379 [2022-11-16 11:49:40,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=419, Invalid=2335, Unknown=10, NotChecked=206, Total=2970 [2022-11-16 11:49:40,560 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 745 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:40,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1063 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1256 Invalid, 0 Unknown, 536 Unchecked, 1.0s Time] [2022-11-16 11:49:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-16 11:49:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 252. [2022-11-16 11:49:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 239 states have (on average 1.292887029288703) internal successors, (309), 251 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 309 transitions. [2022-11-16 11:49:40,567 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 309 transitions. Word has length 43 [2022-11-16 11:49:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:40,567 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 309 transitions. [2022-11-16 11:49:40,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 309 transitions. [2022-11-16 11:49:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:49:40,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:40,569 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:40,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:40,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:40,774 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:40,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1038799272, now seen corresponding path program 2 times [2022-11-16 11:49:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:40,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095845949] [2022-11-16 11:49:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:40,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:41,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095845949] [2022-11-16 11:49:41,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095845949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:41,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601500056] [2022-11-16 11:49:41,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:49:41,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:41,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:41,404 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:41,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:49:41,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:49:41,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:49:41,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 11:49:41,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:41,714 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-16 11:49:41,771 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:41,771 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-16 11:49:41,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:41,831 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-16 11:49:41,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:41,897 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 20 treesize of output 8 [2022-11-16 11:49:41,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:49:42,043 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-16 11:49:42,071 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:42,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:49:42,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:42,126 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-16 11:49:42,168 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 20 treesize of output 8 [2022-11-16 11:49:42,262 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-16 11:49:42,338 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-16 11:49:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:42,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:42,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1218) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-16 11:49:42,835 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:49:42,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 11:49:43,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:43,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-16 11:49:43,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:43,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 63 [2022-11-16 11:49:43,110 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 48 treesize of output 44 [2022-11-16 11:49:43,124 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 22 treesize of output 20 [2022-11-16 11:49:43,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:43,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-16 11:49:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 11:49:43,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601500056] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:43,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:43,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-11-16 11:49:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608696600] [2022-11-16 11:49:43,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:43,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 11:49:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:43,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 11:49:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1401, Unknown=21, NotChecked=78, Total=1722 [2022-11-16 11:49:43,542 INFO L87 Difference]: Start difference. First operand 252 states and 309 transitions. Second operand has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:44,563 INFO L93 Difference]: Finished difference Result 416 states and 500 transitions. [2022-11-16 11:49:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:49:44,564 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 11:49:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:44,566 INFO L225 Difference]: With dead ends: 416 [2022-11-16 11:49:44,566 INFO L226 Difference]: Without dead ends: 416 [2022-11-16 11:49:44,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=442, Invalid=2297, Unknown=21, NotChecked=102, Total=2862 [2022-11-16 11:49:44,567 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 628 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1150 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:44,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 732 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 591 Invalid, 0 Unknown, 1150 Unchecked, 0.5s Time] [2022-11-16 11:49:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-16 11:49:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 268. [2022-11-16 11:49:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 255 states have (on average 1.2862745098039217) internal successors, (328), 267 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 328 transitions. [2022-11-16 11:49:44,574 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 328 transitions. Word has length 43 [2022-11-16 11:49:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:44,575 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 328 transitions. [2022-11-16 11:49:44,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 328 transitions. [2022-11-16 11:49:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:49:44,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:44,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:44,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:44,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 11:49:44,783 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1038491442, now seen corresponding path program 2 times [2022-11-16 11:49:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:44,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50806487] [2022-11-16 11:49:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:45,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:45,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50806487] [2022-11-16 11:49:45,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50806487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:45,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142541168] [2022-11-16 11:49:45,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:49:45,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:45,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:45,677 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:45,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:49:45,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:49:45,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:49:45,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 11:49:45,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:45,879 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-16 11:49:45,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:45,929 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-16 11:49:45,973 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:49:45,974 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-16 11:49:46,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:46,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:49:46,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 11:49:46,274 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-16 11:49:46,338 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-16 11:49:46,375 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:49:46,375 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 16 treesize of output 18 [2022-11-16 11:49:46,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:46,454 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-16 11:49:46,505 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 30 treesize of output 12 [2022-11-16 11:49:46,551 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-16 11:49:46,584 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-16 11:49:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:46,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:46,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-16 11:49:46,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1341) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-16 11:49:46,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-16 11:49:47,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:47,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2022-11-16 11:49:47,555 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 11:49:47,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2022-11-16 11:49:47,571 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 54 treesize of output 46 [2022-11-16 11:49:47,577 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 24 treesize of output 20 [2022-11-16 11:49:47,601 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-16 11:49:47,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2022-11-16 11:49:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-16 11:49:47,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142541168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:47,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:47,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 40 [2022-11-16 11:49:47,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158449652] [2022-11-16 11:49:47,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:47,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 11:49:47,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:47,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 11:49:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1114, Unknown=9, NotChecked=216, Total=1560 [2022-11-16 11:49:47,678 INFO L87 Difference]: Start difference. First operand 268 states and 328 transitions. Second operand has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:48,962 INFO L93 Difference]: Finished difference Result 387 states and 464 transitions. [2022-11-16 11:49:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:49:48,963 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 11:49:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:48,965 INFO L225 Difference]: With dead ends: 387 [2022-11-16 11:49:48,965 INFO L226 Difference]: Without dead ends: 387 [2022-11-16 11:49:48,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=1667, Unknown=9, NotChecked=270, Total=2352 [2022-11-16 11:49:48,966 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 473 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 717 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:48,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 678 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 645 Invalid, 0 Unknown, 717 Unchecked, 0.5s Time] [2022-11-16 11:49:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-16 11:49:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 328. [2022-11-16 11:49:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 315 states have (on average 1.2603174603174603) internal successors, (397), 327 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 397 transitions. [2022-11-16 11:49:48,974 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 397 transitions. Word has length 43 [2022-11-16 11:49:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:48,975 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 397 transitions. [2022-11-16 11:49:48,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 397 transitions. [2022-11-16 11:49:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:49:48,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:48,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:48,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:49,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 11:49:49,182 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1656585800, now seen corresponding path program 1 times [2022-11-16 11:49:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:49,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396436764] [2022-11-16 11:49:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:49,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396436764] [2022-11-16 11:49:49,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396436764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:49,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55498346] [2022-11-16 11:49:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:49,852 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:49,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:49:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:50,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 11:49:50,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:50,192 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-16 11:49:50,267 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:49:50,267 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-16 11:49:50,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:50,365 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-16 11:49:50,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:50,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-16 11:49:50,588 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-16 11:49:50,637 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-16 11:49:50,671 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:49:50,672 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 16 treesize of output 18 [2022-11-16 11:49:50,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:50,739 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-16 11:49:50,791 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 30 treesize of output 12 [2022-11-16 11:49:50,893 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-16 11:49:50,973 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-16 11:49:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:50,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:51,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1462 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-16 11:49:51,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1462 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1462) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-16 11:49:51,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:51,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-16 11:49:51,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:51,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 63 [2022-11-16 11:49:51,626 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 48 treesize of output 44 [2022-11-16 11:49:51,632 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 22 treesize of output 20 [2022-11-16 11:49:52,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:52,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-16 11:49:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-16 11:49:53,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55498346] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:53,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:53,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2022-11-16 11:49:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180115491] [2022-11-16 11:49:53,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:53,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 11:49:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:53,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 11:49:53,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1322, Unknown=19, NotChecked=154, Total=1722 [2022-11-16 11:49:53,025 INFO L87 Difference]: Start difference. First operand 328 states and 397 transitions. Second operand has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:49:54,985 INFO L93 Difference]: Finished difference Result 545 states and 646 transitions. [2022-11-16 11:49:54,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 11:49:54,985 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 11:49:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:49:54,987 INFO L225 Difference]: With dead ends: 545 [2022-11-16 11:49:54,988 INFO L226 Difference]: Without dead ends: 545 [2022-11-16 11:49:54,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=565, Invalid=3080, Unknown=23, NotChecked=238, Total=3906 [2022-11-16 11:49:54,989 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 567 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1112 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:49:54,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1001 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 879 Invalid, 0 Unknown, 1112 Unchecked, 0.7s Time] [2022-11-16 11:49:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-11-16 11:49:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 383. [2022-11-16 11:49:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 370 states have (on average 1.2459459459459459) internal successors, (461), 382 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2022-11-16 11:49:54,999 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 43 [2022-11-16 11:49:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:49:54,999 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2022-11-16 11:49:54,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.7142857142857144) internal successors, (114), 42 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:49:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2022-11-16 11:49:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:49:55,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:49:55,000 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:49:55,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:49:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 11:49:55,206 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:49:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:49:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 745076370, now seen corresponding path program 1 times [2022-11-16 11:49:55,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:49:55,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138580270] [2022-11-16 11:49:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:49:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:55,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:55,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138580270] [2022-11-16 11:49:55,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138580270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:55,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848489456] [2022-11-16 11:49:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:49:55,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:55,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:55,789 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:55,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:49:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:55,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 11:49:55,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:56,086 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-16 11:49:56,146 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:49:56,146 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-16 11:49:56,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:56,219 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-16 11:49:56,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:56,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-16 11:49:56,415 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-16 11:49:56,474 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-16 11:49:56,501 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:49:56,501 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 16 treesize of output 18 [2022-11-16 11:49:56,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:56,563 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-16 11:49:56,613 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 30 treesize of output 12 [2022-11-16 11:49:56,709 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-16 11:49:56,778 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-16 11:49:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:56,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:56,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1583 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1583) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 11:49:56,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1583 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1583) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 11:49:57,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:57,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-16 11:49:57,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:57,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-16 11:49:57,407 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-16 11:49:57,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:57,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-16 11:49:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:49:58,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848489456] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:58,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:49:58,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 40 [2022-11-16 11:49:58,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840313367] [2022-11-16 11:49:58,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:58,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 11:49:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:58,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 11:49:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1190, Unknown=13, NotChecked=146, Total=1560 [2022-11-16 11:49:58,609 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 40 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:00,254 INFO L93 Difference]: Finished difference Result 651 states and 775 transitions. [2022-11-16 11:50:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:50:00,262 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 11:50:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:00,264 INFO L225 Difference]: With dead ends: 651 [2022-11-16 11:50:00,264 INFO L226 Difference]: Without dead ends: 651 [2022-11-16 11:50:00,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=451, Invalid=2194, Unknown=15, NotChecked=202, Total=2862 [2022-11-16 11:50:00,265 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 472 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1060 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:00,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1151 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1145 Invalid, 0 Unknown, 1060 Unchecked, 0.8s Time] [2022-11-16 11:50:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-11-16 11:50:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 462. [2022-11-16 11:50:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 449 states have (on average 1.2383073496659243) internal successors, (556), 461 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 556 transitions. [2022-11-16 11:50:00,280 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 556 transitions. Word has length 43 [2022-11-16 11:50:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:00,280 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 556 transitions. [2022-11-16 11:50:00,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 556 transitions. [2022-11-16 11:50:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:50:00,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:00,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:00,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:00,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:00,491 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1362862898, now seen corresponding path program 2 times [2022-11-16 11:50:00,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:00,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089132917] [2022-11-16 11:50:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:01,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089132917] [2022-11-16 11:50:01,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089132917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:01,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20004678] [2022-11-16 11:50:01,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:50:01,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:01,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:01,106 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:01,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:50:01,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:50:01,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:01,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 11:50:01,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:01,408 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-16 11:50:01,467 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:50:01,468 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-16 11:50:01,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:01,541 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-16 11:50:01,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:01,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-16 11:50:01,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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:50:01,782 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-16 11:50:01,812 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:50:01,812 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 16 treesize of output 18 [2022-11-16 11:50:01,867 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-16 11:50:01,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:01,923 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 30 treesize of output 12 [2022-11-16 11:50:02,014 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-16 11:50:02,085 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-16 11:50:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:02,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:02,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1704) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 11:50:02,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1704) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 11:50:02,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1704) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 11:50:02,810 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 73 treesize of output 69 [2022-11-16 11:50:03,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:03,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 117 [2022-11-16 11:50:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-16 11:50:03,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20004678] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:03,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:03,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 40 [2022-11-16 11:50:03,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538972522] [2022-11-16 11:50:03,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:03,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 11:50:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:03,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 11:50:03,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1132, Unknown=3, NotChecked=216, Total=1560 [2022-11-16 11:50:03,325 INFO L87 Difference]: Start difference. First operand 462 states and 556 transitions. Second operand has 40 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:05,165 INFO L93 Difference]: Finished difference Result 677 states and 807 transitions. [2022-11-16 11:50:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:50:05,174 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 11:50:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:05,176 INFO L225 Difference]: With dead ends: 677 [2022-11-16 11:50:05,176 INFO L226 Difference]: Without dead ends: 677 [2022-11-16 11:50:05,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=531, Invalid=2558, Unknown=3, NotChecked=330, Total=3422 [2022-11-16 11:50:05,179 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 423 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1156 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:05,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 981 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 914 Invalid, 0 Unknown, 1156 Unchecked, 0.7s Time] [2022-11-16 11:50:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-16 11:50:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 489. [2022-11-16 11:50:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 476 states have (on average 1.2352941176470589) internal successors, (588), 488 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 588 transitions. [2022-11-16 11:50:05,198 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 588 transitions. Word has length 43 [2022-11-16 11:50:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:05,198 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 588 transitions. [2022-11-16 11:50:05,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 588 transitions. [2022-11-16 11:50:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:50:05,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:05,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:05,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 11:50:05,405 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:05,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1985636446, now seen corresponding path program 1 times [2022-11-16 11:50:05,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:05,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709985389] [2022-11-16 11:50:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:50:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709985389] [2022-11-16 11:50:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709985389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:05,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:05,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:50:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614791842] [2022-11-16 11:50:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:05,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:50:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:50:05,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:50:05,504 INFO L87 Difference]: Start difference. First operand 489 states and 588 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:05,634 INFO L93 Difference]: Finished difference Result 488 states and 586 transitions. [2022-11-16 11:50:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:50:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-16 11:50:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:05,645 INFO L225 Difference]: With dead ends: 488 [2022-11-16 11:50:05,648 INFO L226 Difference]: Without dead ends: 488 [2022-11-16 11:50:05,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-16 11:50:05,650 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:05,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 181 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:50:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-16 11:50:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2022-11-16 11:50:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 474 states have (on average 1.2341772151898733) internal successors, (585), 486 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 585 transitions. [2022-11-16 11:50:05,666 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 585 transitions. Word has length 45 [2022-11-16 11:50:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:05,667 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 585 transitions. [2022-11-16 11:50:05,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 585 transitions. [2022-11-16 11:50:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:50:05,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:05,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:05,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-16 11:50:05,668 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684670, now seen corresponding path program 2 times [2022-11-16 11:50:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:05,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247805146] [2022-11-16 11:50:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:06,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247805146] [2022-11-16 11:50:06,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247805146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:06,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567109123] [2022-11-16 11:50:06,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:50:06,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:06,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:06,484 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:06,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:50:06,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:50:06,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:06,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 11:50:06,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:06,813 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:50:06,813 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-16 11:50:06,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:06,925 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-16 11:50:06,963 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-16 11:50:06,982 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:50:06,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:50:07,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:50:07,238 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-16 11:50:07,238 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 59 [2022-11-16 11:50:07,248 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 22 treesize of output 14 [2022-11-16 11:50:07,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 11:50:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:07,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:07,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1854 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1854) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-16 11:50:07,551 INFO L321 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-11-16 11:50:07,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-11-16 11:50:07,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:07,678 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-16 11:50:07,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:07,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 11:50:07,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:07,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2022-11-16 11:50:07,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:07,953 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 80 treesize of output 64 [2022-11-16 11:50:07,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-16 11:50:07,974 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:50:07,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 11:50:08,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:08,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-16 11:50:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 11:50:08,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567109123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:08,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:08,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-11-16 11:50:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289958398] [2022-11-16 11:50:08,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:08,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 11:50:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 11:50:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=974, Unknown=18, NotChecked=64, Total=1190 [2022-11-16 11:50:08,342 INFO L87 Difference]: Start difference. First operand 487 states and 585 transitions. Second operand has 35 states, 34 states have (on average 3.0) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:09,989 INFO L93 Difference]: Finished difference Result 595 states and 716 transitions. [2022-11-16 11:50:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:50:09,990 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-16 11:50:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:09,992 INFO L225 Difference]: With dead ends: 595 [2022-11-16 11:50:09,992 INFO L226 Difference]: Without dead ends: 595 [2022-11-16 11:50:09,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=407, Invalid=2129, Unknown=18, NotChecked=98, Total=2652 [2022-11-16 11:50:09,993 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 545 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 860 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:09,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 826 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 649 Invalid, 0 Unknown, 860 Unchecked, 0.6s Time] [2022-11-16 11:50:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-11-16 11:50:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 506. [2022-11-16 11:50:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 493 states have (on average 1.231237322515213) internal successors, (607), 505 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 607 transitions. [2022-11-16 11:50:10,004 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 607 transitions. Word has length 45 [2022-11-16 11:50:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:10,004 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 607 transitions. [2022-11-16 11:50:10,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 607 transitions. [2022-11-16 11:50:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:50:10,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:10,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:10,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:10,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:10,213 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684671, now seen corresponding path program 2 times [2022-11-16 11:50:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:10,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39434743] [2022-11-16 11:50:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:11,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39434743] [2022-11-16 11:50:11,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39434743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:11,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577338165] [2022-11-16 11:50:11,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:50:11,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:11,196 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:11,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:50:11,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:50:11,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:11,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 11:50:11,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:11,648 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:50:11,648 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-16 11:50:11,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:11,750 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-16 11:50:12,071 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:12,071 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 37 treesize of output 35 [2022-11-16 11:50:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:12,079 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-16 11:50:12,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:12,203 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-16 11:50:12,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:12,219 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 37 treesize of output 35 [2022-11-16 11:50:12,326 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-16 11:50:12,326 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 22 treesize of output 24 [2022-11-16 11:50:12,469 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 11:50:12,469 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 43 treesize of output 30 [2022-11-16 11:50:12,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:12,477 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 16 treesize of output 18 [2022-11-16 11:50:12,936 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:50:12,936 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 79 [2022-11-16 11:50:12,943 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 28 treesize of output 30 [2022-11-16 11:50:13,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:13,340 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:50:13,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 26 [2022-11-16 11:50:13,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:13,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-16 11:50:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:13,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:13,676 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1975 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1976) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-16 11:50:13,713 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1976) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_1975 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 11:50:13,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1975 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1976) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:50:13,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:13,738 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 63 treesize of output 67 [2022-11-16 11:50:13,781 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_prenex_21 (Array Int Int)) (v_prenex_22 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_22) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (+ 9 |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1973) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_1976 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1976) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 11:50:13,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:13,959 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-16 11:50:14,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:14,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 11:50:14,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:14,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 69 [2022-11-16 11:50:14,702 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 54 treesize of output 46 [2022-11-16 11:50:14,708 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 24 treesize of output 20 [2022-11-16 11:50:14,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:14,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 11:50:14,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:14,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:14,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:50:14,834 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 7 treesize of output 3 [2022-11-16 11:50:14,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:14,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 11:50:14,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:14,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:14,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:50:14,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:14,889 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 22 treesize of output 22 [2022-11-16 11:50:15,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:15,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-16 11:50:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-16 11:50:16,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577338165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:16,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:16,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 49 [2022-11-16 11:50:16,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659299959] [2022-11-16 11:50:16,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:16,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 11:50:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 11:50:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1862, Unknown=12, NotChecked=364, Total=2450 [2022-11-16 11:50:16,369 INFO L87 Difference]: Start difference. First operand 506 states and 607 transitions. Second operand has 50 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 50 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:21,869 INFO L93 Difference]: Finished difference Result 594 states and 712 transitions. [2022-11-16 11:50:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 11:50:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 50 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-16 11:50:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:21,872 INFO L225 Difference]: With dead ends: 594 [2022-11-16 11:50:21,873 INFO L226 Difference]: Without dead ends: 594 [2022-11-16 11:50:21,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=565, Invalid=4131, Unknown=12, NotChecked=548, Total=5256 [2022-11-16 11:50:21,874 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 719 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1238 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:21,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1184 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 681 Invalid, 0 Unknown, 1238 Unchecked, 0.6s Time] [2022-11-16 11:50:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-16 11:50:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 505. [2022-11-16 11:50:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 492 states have (on average 1.2296747967479675) internal successors, (605), 504 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 605 transitions. [2022-11-16 11:50:21,884 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 605 transitions. Word has length 45 [2022-11-16 11:50:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:21,884 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 605 transitions. [2022-11-16 11:50:21,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 50 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 605 transitions. [2022-11-16 11:50:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:50:21,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:21,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:21,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:22,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:22,091 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:22,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1453916066, now seen corresponding path program 1 times [2022-11-16 11:50:22,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:22,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037963663] [2022-11-16 11:50:22,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:22,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:22,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:22,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037963663] [2022-11-16 11:50:22,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037963663] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:22,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913308175] [2022-11-16 11:50:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:22,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:22,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:22,835 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:22,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:50:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 11:50:23,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:23,239 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:50:23,239 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-16 11:50:23,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:23,510 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:23,510 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 37 treesize of output 35 [2022-11-16 11:50:23,578 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:23,578 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 37 treesize of output 35 [2022-11-16 11:50:23,606 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-16 11:50:23,607 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 22 treesize of output 24 [2022-11-16 11:50:23,684 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 11:50:23,684 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 43 treesize of output 30 [2022-11-16 11:50:23,952 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:50:23,952 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 67 [2022-11-16 11:50:24,164 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:50:24,164 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-16 11:50:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:24,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:24,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2092 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-16 11:50:26,470 INFO L321 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-11-16 11:50:26,470 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 31 treesize of output 30 [2022-11-16 11:50:26,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:26,674 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-16 11:50:26,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:26,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 11:50:26,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:26,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2022-11-16 11:50:26,967 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 142 treesize of output 126 [2022-11-16 11:50:26,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:26,979 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 136 treesize of output 108 [2022-11-16 11:50:27,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:27,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-16 11:50:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:50:28,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913308175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:28,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:28,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 43 [2022-11-16 11:50:28,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232039927] [2022-11-16 11:50:28,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:28,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-16 11:50:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:28,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-16 11:50:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1559, Unknown=18, NotChecked=82, Total=1892 [2022-11-16 11:50:28,749 INFO L87 Difference]: Start difference. First operand 505 states and 605 transitions. Second operand has 44 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 44 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:30,622 INFO L93 Difference]: Finished difference Result 567 states and 669 transitions. [2022-11-16 11:50:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:50:30,623 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 44 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-16 11:50:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:30,625 INFO L225 Difference]: With dead ends: 567 [2022-11-16 11:50:30,625 INFO L226 Difference]: Without dead ends: 567 [2022-11-16 11:50:30,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=585, Invalid=3061, Unknown=18, NotChecked=118, Total=3782 [2022-11-16 11:50:30,627 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 681 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1076 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:30,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 944 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 716 Invalid, 0 Unknown, 1076 Unchecked, 0.6s Time] [2022-11-16 11:50:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-16 11:50:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 505. [2022-11-16 11:50:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 492 states have (on average 1.2276422764227641) internal successors, (604), 504 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 604 transitions. [2022-11-16 11:50:30,636 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 604 transitions. Word has length 45 [2022-11-16 11:50:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:30,636 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 604 transitions. [2022-11-16 11:50:30,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 44 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 604 transitions. [2022-11-16 11:50:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:50:30,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:30,638 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:30,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:30,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-16 11:50:30,844 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1453916065, now seen corresponding path program 1 times [2022-11-16 11:50:30,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:30,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491367062] [2022-11-16 11:50:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:31,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:31,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491367062] [2022-11-16 11:50:31,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491367062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:31,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142647814] [2022-11-16 11:50:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:31,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:31,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:31,727 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:31,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 11:50:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:31,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 11:50:31,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:32,186 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:50:32,187 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-16 11:50:32,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:32,290 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-16 11:50:32,597 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:32,597 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 37 treesize of output 35 [2022-11-16 11:50:32,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:32,604 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-16 11:50:32,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:32,723 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 37 treesize of output 35 [2022-11-16 11:50:32,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:32,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:50:32,842 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-16 11:50:32,842 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 22 treesize of output 24 [2022-11-16 11:50:32,988 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 11:50:32,988 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 43 treesize of output 30 [2022-11-16 11:50:33,003 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 16 treesize of output 18 [2022-11-16 11:50:33,449 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:50:33,450 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 79 [2022-11-16 11:50:33,456 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 28 treesize of output 30 [2022-11-16 11:50:33,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:33,872 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:50:33,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 26 [2022-11-16 11:50:33,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:33,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-16 11:50:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:33,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:34,286 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2213) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2214) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_2213 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2213) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 11:50:34,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:34,436 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 63 treesize of output 67 [2022-11-16 11:50:34,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:34,838 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-16 11:50:35,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:35,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 11:50:35,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:35,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 69 [2022-11-16 11:50:35,565 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 54 treesize of output 46 [2022-11-16 11:50:35,571 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 24 treesize of output 20 [2022-11-16 11:50:35,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:35,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 11:50:35,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:35,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:35,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:50:35,700 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 7 treesize of output 3 [2022-11-16 11:50:35,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:35,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 11:50:35,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:35,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:35,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:50:35,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:35,729 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 22 treesize of output 22 [2022-11-16 11:50:36,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:36,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-16 11:50:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 11:50:37,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142647814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:37,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:37,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-11-16 11:50:37,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515275404] [2022-11-16 11:50:37,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:37,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 11:50:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:37,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 11:50:37,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2006, Unknown=35, NotChecked=92, Total=2352 [2022-11-16 11:50:37,689 INFO L87 Difference]: Start difference. First operand 505 states and 604 transitions. Second operand has 49 states, 48 states have (on average 2.7291666666666665) internal successors, (131), 49 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:39,506 INFO L93 Difference]: Finished difference Result 513 states and 608 transitions. [2022-11-16 11:50:39,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 11:50:39,507 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.7291666666666665) internal successors, (131), 49 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-16 11:50:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:39,510 INFO L225 Difference]: With dead ends: 513 [2022-11-16 11:50:39,510 INFO L226 Difference]: Without dead ends: 513 [2022-11-16 11:50:39,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=479, Invalid=4046, Unknown=35, NotChecked=132, Total=4692 [2022-11-16 11:50:39,510 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 212 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:39,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 983 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 320 Invalid, 0 Unknown, 750 Unchecked, 0.3s Time] [2022-11-16 11:50:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-11-16 11:50:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 478. [2022-11-16 11:50:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 465 states have (on average 1.221505376344086) internal successors, (568), 477 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 568 transitions. [2022-11-16 11:50:39,519 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 568 transitions. Word has length 45 [2022-11-16 11:50:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:39,519 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 568 transitions. [2022-11-16 11:50:39,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.7291666666666665) internal successors, (131), 49 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 568 transitions. [2022-11-16 11:50:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:50:39,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:39,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:39,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:39,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-16 11:50:39,726 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash -63394326, now seen corresponding path program 1 times [2022-11-16 11:50:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:39,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092726760] [2022-11-16 11:50:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:40,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092726760] [2022-11-16 11:50:40,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092726760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:40,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432417649] [2022-11-16 11:50:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:40,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:40,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:40,227 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:40,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 11:50:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:40,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 11:50:40,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:40,622 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:50:40,623 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-16 11:50:40,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:40,887 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:40,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-16 11:50:41,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:41,375 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-11-16 11:50:41,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 24 [2022-11-16 11:50:41,511 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-16 11:50:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:41,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:41,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:41,804 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 25 treesize of output 29 [2022-11-16 11:50:42,013 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2287 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_2287 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_main_~a~0#1.base|))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse0 8))))) is different from false [2022-11-16 11:50:42,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:42,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-11-16 11:50:42,301 INFO L321 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2022-11-16 11:50:42,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2022-11-16 11:50:42,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:42,343 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 9 treesize of output 3 [2022-11-16 11:50:42,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:42,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-16 11:50:42,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:42,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-16 11:50:42,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-16 11:50:42,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:42,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 78 [2022-11-16 11:50:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:50:42,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432417649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:42,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:42,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 20] total 45 [2022-11-16 11:50:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594921809] [2022-11-16 11:50:42,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:42,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 11:50:42,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:42,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 11:50:42,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1786, Unknown=27, NotChecked=86, Total=2070 [2022-11-16 11:50:42,929 INFO L87 Difference]: Start difference. First operand 478 states and 568 transitions. Second operand has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:45,132 INFO L93 Difference]: Finished difference Result 526 states and 619 transitions. [2022-11-16 11:50:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:50:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-16 11:50:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:45,135 INFO L225 Difference]: With dead ends: 526 [2022-11-16 11:50:45,135 INFO L226 Difference]: Without dead ends: 526 [2022-11-16 11:50:45,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 5 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=528, Invalid=3607, Unknown=29, NotChecked=126, Total=4290 [2022-11-16 11:50:45,136 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 308 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 694 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:45,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1080 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 984 Invalid, 0 Unknown, 694 Unchecked, 0.8s Time] [2022-11-16 11:50:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-16 11:50:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 486. [2022-11-16 11:50:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 473 states have (on average 1.2198731501057083) internal successors, (577), 485 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 577 transitions. [2022-11-16 11:50:45,144 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 577 transitions. Word has length 46 [2022-11-16 11:50:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:45,144 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 577 transitions. [2022-11-16 11:50:45,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 577 transitions. [2022-11-16 11:50:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:50:45,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:45,146 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:45,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:45,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-16 11:50:45,351 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash -63394325, now seen corresponding path program 1 times [2022-11-16 11:50:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:45,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602524741] [2022-11-16 11:50:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:46,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:46,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602524741] [2022-11-16 11:50:46,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602524741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:46,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060573347] [2022-11-16 11:50:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:46,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:46,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:46,132 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:46,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 11:50:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:46,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 11:50:46,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:46,475 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:50:46,476 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-16 11:50:46,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:50:46,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:46,542 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-16 11:50:46,699 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:46,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-16 11:50:46,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:50:46,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:46,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-11-16 11:50:46,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:46,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-16 11:50:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:50:47,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:47,479 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2365) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_2364 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8)))) is different from false [2022-11-16 11:50:47,505 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2364) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2365) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_2364 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2364) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8)))) is different from false [2022-11-16 11:50:47,516 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_2364 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2364) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8))) (forall ((v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2364) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2365) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))))) is different from false [2022-11-16 11:50:47,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:47,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-11-16 11:50:47,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:47,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-11-16 11:50:47,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:47,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-11-16 11:50:47,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:47,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 81 [2022-11-16 11:50:47,567 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 66 treesize of output 62 [2022-11-16 11:50:47,572 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 32 treesize of output 28 [2022-11-16 11:50:47,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:47,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 11:50:47,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:47,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:47,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2022-11-16 11:50:47,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:47,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-16 11:50:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-16 11:50:47,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060573347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:47,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:47,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 40 [2022-11-16 11:50:47,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554994138] [2022-11-16 11:50:47,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:47,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 11:50:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:47,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 11:50:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1243, Unknown=3, NotChecked=222, Total=1640 [2022-11-16 11:50:47,913 INFO L87 Difference]: Start difference. First operand 486 states and 577 transitions. Second operand has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:50,490 INFO L93 Difference]: Finished difference Result 540 states and 632 transitions. [2022-11-16 11:50:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-16 11:50:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-16 11:50:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:50,492 INFO L225 Difference]: With dead ends: 540 [2022-11-16 11:50:50,492 INFO L226 Difference]: Without dead ends: 540 [2022-11-16 11:50:50,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=683, Invalid=3882, Unknown=3, NotChecked=402, Total=4970 [2022-11-16 11:50:50,493 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 673 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:50,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 765 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1111 Invalid, 0 Unknown, 565 Unchecked, 0.9s Time] [2022-11-16 11:50:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-11-16 11:50:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 490. [2022-11-16 11:50:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 478 states have (on average 1.215481171548117) internal successors, (581), 489 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 581 transitions. [2022-11-16 11:50:50,500 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 581 transitions. Word has length 46 [2022-11-16 11:50:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:50,501 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 581 transitions. [2022-11-16 11:50:50,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 581 transitions. [2022-11-16 11:50:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 11:50:50,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:50,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:50,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-16 11:50:50,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-16 11:50:50,707 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:50:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1689205847, now seen corresponding path program 2 times [2022-11-16 11:50:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:50,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126940071] [2022-11-16 11:50:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:51,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:51,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126940071] [2022-11-16 11:50:51,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126940071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:51,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797009160] [2022-11-16 11:50:51,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:50:51,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:51,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:51,261 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:51,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-16 11:50:51,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:50:51,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:51,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 11:50:51,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:51,600 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:50:51,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:50:51,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:51,810 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:51,810 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 30 treesize of output 28 [2022-11-16 11:50:51,861 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:51,862 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 30 treesize of output 28 [2022-11-16 11:50:51,884 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:50:51,884 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-16 11:50:51,949 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 11:50:51,949 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 37 treesize of output 28 [2022-11-16 11:50:52,178 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-16 11:50:52,178 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2022-11-16 11:50:52,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-16 11:50:52,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:52,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2022-11-16 11:50:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:50:52,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:52,484 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2482) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2022-11-16 11:50:52,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2482) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2022-11-16 11:50:52,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:52,748 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 11:50:53,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:53,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 11:50:53,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:53,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 154 [2022-11-16 11:50:53,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:53,081 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 149 treesize of output 125 [2022-11-16 11:50:53,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-11-16 11:50:53,102 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:50:53,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 11:50:53,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:53,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2022-11-16 11:50:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:50:53,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797009160] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:53,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:53,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 42 [2022-11-16 11:50:53,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648315412] [2022-11-16 11:50:53,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:53,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 11:50:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:53,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 11:50:53,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1415, Unknown=15, NotChecked=154, Total=1722 [2022-11-16 11:50:53,491 INFO L87 Difference]: Start difference. First operand 490 states and 581 transitions. Second operand has 42 states, 42 states have (on average 2.9523809523809526) internal successors, (124), 42 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:00,332 INFO L93 Difference]: Finished difference Result 1038 states and 1221 transitions. [2022-11-16 11:51:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-16 11:51:00,333 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9523809523809526) internal successors, (124), 42 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-16 11:51:00,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:00,336 INFO L225 Difference]: With dead ends: 1038 [2022-11-16 11:51:00,336 INFO L226 Difference]: Without dead ends: 1035 [2022-11-16 11:51:00,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 76 SyntacticMatches, 20 SemanticMatches, 112 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 4128 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1305, Invalid=11119, Unknown=16, NotChecked=442, Total=12882 [2022-11-16 11:51:00,338 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 812 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 3616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1833 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:00,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1967 Invalid, 3616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1680 Invalid, 0 Unknown, 1833 Unchecked, 1.4s Time] [2022-11-16 11:51:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-11-16 11:51:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 656. [2022-11-16 11:51:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 644 states have (on average 1.2173913043478262) internal successors, (784), 655 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 784 transitions. [2022-11-16 11:51:00,350 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 784 transitions. Word has length 48 [2022-11-16 11:51:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:00,350 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 784 transitions. [2022-11-16 11:51:00,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9523809523809526) internal successors, (124), 42 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 784 transitions. [2022-11-16 11:51:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 11:51:00,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:00,352 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:00,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:00,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:00,560 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:51:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1798455383, now seen corresponding path program 2 times [2022-11-16 11:51:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:00,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187061160] [2022-11-16 11:51:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:01,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187061160] [2022-11-16 11:51:01,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187061160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:01,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502537583] [2022-11-16 11:51:01,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:51:01,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:01,247 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:01,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-16 11:51:01,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:51:01,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:51:01,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 11:51:01,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:01,647 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:01,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:51:01,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:51:01,947 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:01,947 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 36 treesize of output 34 [2022-11-16 11:51:02,038 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:02,039 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 36 treesize of output 34 [2022-11-16 11:51:02,072 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:02,073 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-16 11:51:02,166 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 11:51:02,167 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 43 treesize of output 30 [2022-11-16 11:51:02,485 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-16 11:51:02,485 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 58 [2022-11-16 11:51:02,491 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 22 treesize of output 14 [2022-11-16 11:51:02,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:02,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2022-11-16 11:51:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:02,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:03,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2599 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2599) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-16 11:51:03,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2599 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2599) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-16 11:51:03,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:03,499 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 11:51:04,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:04,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-16 11:51:04,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:04,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 166 [2022-11-16 11:51:04,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:04,039 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 161 treesize of output 133 [2022-11-16 11:51:04,047 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 118 treesize of output 102 [2022-11-16 11:51:04,065 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:51:04,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 11:51:04,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:04,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2022-11-16 11:51:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:51:04,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502537583] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:04,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:04,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 45 [2022-11-16 11:51:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578371009] [2022-11-16 11:51:04,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:04,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 11:51:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:04,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 11:51:04,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1640, Unknown=18, NotChecked=166, Total=1980 [2022-11-16 11:51:04,661 INFO L87 Difference]: Start difference. First operand 656 states and 784 transitions. Second operand has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 45 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:06,996 INFO L93 Difference]: Finished difference Result 730 states and 861 transitions. [2022-11-16 11:51:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:51:06,997 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 45 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-16 11:51:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:06,999 INFO L225 Difference]: With dead ends: 730 [2022-11-16 11:51:06,999 INFO L226 Difference]: Without dead ends: 730 [2022-11-16 11:51:07,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=507, Invalid=3773, Unknown=18, NotChecked=258, Total=4556 [2022-11-16 11:51:07,001 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 357 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 893 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:07,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1021 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 601 Invalid, 0 Unknown, 893 Unchecked, 0.5s Time] [2022-11-16 11:51:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-11-16 11:51:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 656. [2022-11-16 11:51:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 644 states have (on average 1.2158385093167703) internal successors, (783), 655 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 783 transitions. [2022-11-16 11:51:07,013 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 783 transitions. Word has length 48 [2022-11-16 11:51:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:07,014 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 783 transitions. [2022-11-16 11:51:07,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 45 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 783 transitions. [2022-11-16 11:51:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:51:07,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:07,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:07,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:07,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:07,224 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:51:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1205371029, now seen corresponding path program 1 times [2022-11-16 11:51:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:07,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644226874] [2022-11-16 11:51:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:07,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:07,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644226874] [2022-11-16 11:51:07,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644226874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:07,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437544778] [2022-11-16 11:51:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:07,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:07,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:07,746 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:07,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-16 11:51:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:08,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:51:08,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:08,168 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:08,168 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-16 11:51:08,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:51:08,418 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:08,418 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 32 treesize of output 33 [2022-11-16 11:51:08,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:08,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 11:51:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:51:08,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:09,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_209| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_209| 1) 0) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2672) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_209|)) |c_#StackHeapBarrier|) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_209|))) is different from false [2022-11-16 11:51:09,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:09,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 11:51:09,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:09,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:51:09,493 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 11 treesize of output 7 [2022-11-16 11:51:09,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:09,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2022-11-16 11:51:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:51:09,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437544778] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:09,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:09,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 33 [2022-11-16 11:51:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673465516] [2022-11-16 11:51:09,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:09,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 11:51:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:09,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 11:51:09,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=939, Unknown=12, NotChecked=62, Total=1122 [2022-11-16 11:51:09,896 INFO L87 Difference]: Start difference. First operand 656 states and 783 transitions. Second operand has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:10,879 INFO L93 Difference]: Finished difference Result 680 states and 807 transitions. [2022-11-16 11:51:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:51:10,879 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-16 11:51:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:10,881 INFO L225 Difference]: With dead ends: 680 [2022-11-16 11:51:10,881 INFO L226 Difference]: Without dead ends: 680 [2022-11-16 11:51:10,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=268, Invalid=1793, Unknown=13, NotChecked=88, Total=2162 [2022-11-16 11:51:10,882 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 95 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:10,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 792 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 403 Invalid, 0 Unknown, 287 Unchecked, 0.3s Time] [2022-11-16 11:51:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-11-16 11:51:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2022-11-16 11:51:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 664 states have (on average 1.2108433734939759) internal successors, (804), 675 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 804 transitions. [2022-11-16 11:51:10,892 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 804 transitions. Word has length 49 [2022-11-16 11:51:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:10,892 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 804 transitions. [2022-11-16 11:51:10,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 804 transitions. [2022-11-16 11:51:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:51:10,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:10,894 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:10,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:11,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-16 11:51:11,101 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:51:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1506898475, now seen corresponding path program 1 times [2022-11-16 11:51:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:11,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103409837] [2022-11-16 11:51:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:11,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:11,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103409837] [2022-11-16 11:51:11,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103409837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:11,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359822371] [2022-11-16 11:51:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:11,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:11,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:11,548 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:11,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-16 11:51:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:11,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 11:51:11,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:12,044 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:12,045 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-16 11:51:12,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:51:12,377 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:12,377 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 32 treesize of output 33 [2022-11-16 11:51:12,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:12,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 11:51:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:12,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:13,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2745) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|))) is different from false [2022-11-16 11:51:13,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:13,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 11:51:13,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:13,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:51:13,737 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 11 treesize of output 7 [2022-11-16 11:51:14,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:14,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-16 11:51:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:51:14,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359822371] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:14,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:14,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 38 [2022-11-16 11:51:14,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328177229] [2022-11-16 11:51:14,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:14,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 11:51:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 11:51:14,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1225, Unknown=17, NotChecked=72, Total=1482 [2022-11-16 11:51:14,203 INFO L87 Difference]: Start difference. First operand 676 states and 804 transitions. Second operand has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 39 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:15,453 INFO L93 Difference]: Finished difference Result 685 states and 812 transitions. [2022-11-16 11:51:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:51:15,453 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 39 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-16 11:51:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:15,456 INFO L225 Difference]: With dead ends: 685 [2022-11-16 11:51:15,456 INFO L226 Difference]: Without dead ends: 685 [2022-11-16 11:51:15,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=487, Invalid=2577, Unknown=20, NotChecked=108, Total=3192 [2022-11-16 11:51:15,456 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 212 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:15,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 888 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 564 Invalid, 0 Unknown, 403 Unchecked, 0.4s Time] [2022-11-16 11:51:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-16 11:51:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 675. [2022-11-16 11:51:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 663 states have (on average 1.2111613876319758) internal successors, (803), 674 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 803 transitions. [2022-11-16 11:51:15,466 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 803 transitions. Word has length 49 [2022-11-16 11:51:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:15,466 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 803 transitions. [2022-11-16 11:51:15,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 39 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 803 transitions. [2022-11-16 11:51:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:51:15,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:15,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:15,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:15,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-16 11:51:15,675 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:51:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1278187334, now seen corresponding path program 1 times [2022-11-16 11:51:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:15,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607697094] [2022-11-16 11:51:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:16,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607697094] [2022-11-16 11:51:16,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607697094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:16,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22685861] [2022-11-16 11:51:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:16,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:16,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:16,094 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:16,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-16 11:51:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:16,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:51:16,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:16,482 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:16,482 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-16 11:51:16,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:51:16,728 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:16,729 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 32 treesize of output 33 [2022-11-16 11:51:17,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:17,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 11:51:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:51:17,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:17,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_2818 (Array Int Int))) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2818) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-16 11:51:17,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_231| Int) (v_ArrVal_2818 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2818) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_231|)) |c_#StackHeapBarrier|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_231| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_231|))) is different from false [2022-11-16 11:51:17,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:17,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 11:51:17,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:17,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:51:17,780 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 11 treesize of output 7 [2022-11-16 11:51:18,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:18,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2022-11-16 11:51:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:51:18,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22685861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:18,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:18,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 33 [2022-11-16 11:51:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351328435] [2022-11-16 11:51:18,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:18,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 11:51:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:18,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 11:51:18,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=881, Unknown=11, NotChecked=122, Total=1122 [2022-11-16 11:51:18,176 INFO L87 Difference]: Start difference. First operand 675 states and 803 transitions. Second operand has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:19,016 INFO L93 Difference]: Finished difference Result 681 states and 808 transitions. [2022-11-16 11:51:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:51:19,016 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 11:51:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:19,019 INFO L225 Difference]: With dead ends: 681 [2022-11-16 11:51:19,019 INFO L226 Difference]: Without dead ends: 681 [2022-11-16 11:51:19,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=237, Invalid=1737, Unknown=14, NotChecked=174, Total=2162 [2022-11-16 11:51:19,020 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 86 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:19,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 779 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 330 Invalid, 0 Unknown, 337 Unchecked, 0.3s Time] [2022-11-16 11:51:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-11-16 11:51:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 654. [2022-11-16 11:51:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 642 states have (on average 1.2165109034267914) internal successors, (781), 653 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 781 transitions. [2022-11-16 11:51:19,029 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 781 transitions. Word has length 51 [2022-11-16 11:51:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:19,029 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 781 transitions. [2022-11-16 11:51:19,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 34 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 781 transitions. [2022-11-16 11:51:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:51:19,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:19,031 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:19,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-16 11:51:19,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:19,238 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:51:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash 84710120, now seen corresponding path program 2 times [2022-11-16 11:51:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:19,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604120706] [2022-11-16 11:51:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:19,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604120706] [2022-11-16 11:51:20,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604120706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292687681] [2022-11-16 11:51:20,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:51:20,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:20,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:20,315 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:20,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-16 11:51:20,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:51:20,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:51:20,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-16 11:51:20,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:20,670 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:51:20,670 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-16 11:51:20,763 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-16 11:51:20,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:51:21,040 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:51:21,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 11:51:21,044 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 11 treesize of output 7 [2022-11-16 11:51:21,066 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:21,066 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 31 treesize of output 29 [2022-11-16 11:51:21,189 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:21,189 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 31 treesize of output 29 [2022-11-16 11:51:21,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:21,202 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-16 11:51:21,214 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-16 11:51:21,301 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 11:51:21,302 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 20 treesize of output 22 [2022-11-16 11:51:21,415 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:51:21,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 11:51:21,423 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 11 treesize of output 7 [2022-11-16 11:51:21,436 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-16 11:51:21,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:21,455 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 11:51:21,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2022-11-16 11:51:21,784 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:51:21,784 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 99 [2022-11-16 11:51:21,797 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:21,797 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 110 treesize of output 103 [2022-11-16 11:51:21,809 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 36 treesize of output 38 [2022-11-16 11:51:22,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:22,037 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:22,038 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 63 treesize of output 30 [2022-11-16 11:51:22,042 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 33 treesize of output 17 [2022-11-16 11:51:22,148 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-16 11:51:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:22,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:22,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int))) (= 2 (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2944) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2945) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 11:51:22,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int))) (= 2 (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2944) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2945) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 11:51:22,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2938 Int) (v_ArrVal_2942 (Array Int Int))) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_2938)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2944) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2942) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2945) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2)) is different from false [2022-11-16 11:51:22,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:22,526 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-11-16 11:51:22,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:22,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2022-11-16 11:51:22,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:22,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2022-11-16 11:51:22,558 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 45 treesize of output 27 [2022-11-16 11:51:22,605 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 30 treesize of output 22 [2022-11-16 11:51:24,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:24,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 109 [2022-11-16 11:51:24,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:24,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 99 [2022-11-16 11:51:24,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:24,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 146 [2022-11-16 11:51:24,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2022-11-16 11:51:24,640 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 122 treesize of output 114 [2022-11-16 11:51:24,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:24,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 246 [2022-11-16 11:51:24,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:24,674 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 230 treesize of output 199 [2022-11-16 11:51:24,683 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 190 treesize of output 182 [2022-11-16 11:51:24,691 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 182 treesize of output 174 [2022-11-16 11:51:24,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:24,706 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 174 treesize of output 159 [2022-11-16 11:51:27,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:27,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 255 [2022-11-16 11:51:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-16 11:51:27,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292687681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:27,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:27,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 45 [2022-11-16 11:51:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773223151] [2022-11-16 11:51:27,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:27,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 11:51:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:27,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 11:51:27,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1512, Unknown=29, NotChecked=246, Total=1980 [2022-11-16 11:51:27,974 INFO L87 Difference]: Start difference. First operand 654 states and 781 transitions. Second operand has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:31,645 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2938 Int) (v_ArrVal_2942 (Array Int Int))) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_2938)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2944) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2942) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2945) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-16 11:51:31,969 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2944) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2945) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (select (select (store |c_#memory_int| .cse1 v_ArrVal_2944) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2943) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2945) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)))) is different from false [2022-11-16 11:51:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:33,775 INFO L93 Difference]: Finished difference Result 966 states and 1167 transitions. [2022-11-16 11:51:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-16 11:51:33,775 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 11:51:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:33,779 INFO L225 Difference]: With dead ends: 966 [2022-11-16 11:51:33,780 INFO L226 Difference]: Without dead ends: 966 [2022-11-16 11:51:33,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=503, Invalid=3763, Unknown=44, NotChecked=660, Total=4970 [2022-11-16 11:51:33,780 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 602 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1723 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:33,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1827 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1693 Invalid, 0 Unknown, 1723 Unchecked, 1.5s Time] [2022-11-16 11:51:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-11-16 11:51:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 656. [2022-11-16 11:51:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 644 states have (on average 1.2158385093167703) internal successors, (783), 655 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 783 transitions. [2022-11-16 11:51:33,789 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 783 transitions. Word has length 51 [2022-11-16 11:51:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:33,789 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 783 transitions. [2022-11-16 11:51:33,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 783 transitions. [2022-11-16 11:51:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:51:33,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:33,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:33,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:33,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-16 11:51:33,998 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:51:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash 84402290, now seen corresponding path program 1 times [2022-11-16 11:51:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:33,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460961822] [2022-11-16 11:51:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:35,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:35,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460961822] [2022-11-16 11:51:35,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460961822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:35,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898807489] [2022-11-16 11:51:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:35,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:35,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:35,514 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:35,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-16 11:51:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:35,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-16 11:51:35,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:35,890 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:51:35,891 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-16 11:51:35,977 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-16 11:51:35,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:51:36,172 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:36,172 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 37 treesize of output 35 [2022-11-16 11:51:36,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:36,184 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-16 11:51:36,191 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-16 11:51:36,357 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-16 11:51:36,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:36,375 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 21 treesize of output 20 [2022-11-16 11:51:36,384 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-16 11:51:36,422 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:51:36,422 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 16 treesize of output 18 [2022-11-16 11:51:36,473 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 23 treesize of output 22 [2022-11-16 11:51:36,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:51:36,493 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 16 treesize of output 18 [2022-11-16 11:51:36,727 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:51:36,727 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 71 [2022-11-16 11:51:36,746 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 30 treesize of output 32 [2022-11-16 11:51:36,754 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 26 treesize of output 28 [2022-11-16 11:51:36,942 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:36,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-11-16 11:51:36,948 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-16 11:51:36,983 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-16 11:51:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:37,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:37,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3074 (Array Int Int)) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3073) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3074) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3072) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0)) is different from false [2022-11-16 11:51:37,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3074 (Array Int Int)) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3073) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3074) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3072) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0)) is different from false [2022-11-16 11:51:37,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3074 (Array Int Int)) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3073) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3074) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3072) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) 0)) is different from false [2022-11-16 11:51:37,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:37,444 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-16 11:51:38,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 77 [2022-11-16 11:51:38,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 123 [2022-11-16 11:51:38,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-16 11:51:38,172 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 30 treesize of output 22 [2022-11-16 11:51:38,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-16 11:51:38,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 198 [2022-11-16 11:51:38,720 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 182 treesize of output 166 [2022-11-16 11:51:38,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,731 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 177 treesize of output 117 [2022-11-16 11:51:38,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 11:51:38,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:38,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:51:38,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,854 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 22 treesize of output 22 [2022-11-16 11:51:38,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 11:51:38,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:38,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:38,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:51:38,891 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 7 treesize of output 3 [2022-11-16 11:51:39,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:39,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-16 11:51:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-16 11:51:41,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898807489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:41,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:41,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 48 [2022-11-16 11:51:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479820500] [2022-11-16 11:51:41,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:41,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 11:51:41,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 11:51:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1769, Unknown=24, NotChecked=264, Total=2256 [2022-11-16 11:51:41,864 INFO L87 Difference]: Start difference. First operand 656 states and 783 transitions. Second operand has 48 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 48 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:44,278 INFO L93 Difference]: Finished difference Result 899 states and 1082 transitions. [2022-11-16 11:51:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:51:44,278 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 48 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 11:51:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:44,282 INFO L225 Difference]: With dead ends: 899 [2022-11-16 11:51:44,282 INFO L226 Difference]: Without dead ends: 899 [2022-11-16 11:51:44,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=358, Invalid=2600, Unknown=24, NotChecked=324, Total=3306 [2022-11-16 11:51:44,283 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 454 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1802 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:44,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1733 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1503 Invalid, 0 Unknown, 1802 Unchecked, 1.4s Time] [2022-11-16 11:51:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-11-16 11:51:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 654. [2022-11-16 11:51:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 642 states have (on average 1.2133956386292835) internal successors, (779), 653 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 779 transitions. [2022-11-16 11:51:44,293 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 779 transitions. Word has length 51 [2022-11-16 11:51:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:44,293 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 779 transitions. [2022-11-16 11:51:44,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 48 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 779 transitions. [2022-11-16 11:51:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:51:44,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:44,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:44,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:44,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-11-16 11:51:44,501 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:51:44,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash -583491704, now seen corresponding path program 1 times [2022-11-16 11:51:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:44,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897777492] [2022-11-16 11:51:44,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897777492] [2022-11-16 11:51:46,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897777492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111363521] [2022-11-16 11:51:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:46,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:46,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:46,038 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:46,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-16 11:51:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:46,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-16 11:51:46,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:46,422 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:51:46,422 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-16 11:51:46,511 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-16 11:51:46,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:51:46,722 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:51:46,723 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 16 treesize of output 22 [2022-11-16 11:51:46,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:51:46,760 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:46,760 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 37 treesize of output 35 [2022-11-16 11:51:46,774 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-16 11:51:46,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:46,981 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 22 treesize of output 21 [2022-11-16 11:51:46,988 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-16 11:51:46,997 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-16 11:51:47,037 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:51:47,037 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 16 treesize of output 18 [2022-11-16 11:51:47,084 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 23 treesize of output 22 [2022-11-16 11:51:47,094 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 16 treesize of output 18 [2022-11-16 11:51:47,105 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 24 treesize of output 23 [2022-11-16 11:51:47,338 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:51:47,339 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 72 [2022-11-16 11:51:47,343 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 31 treesize of output 33 [2022-11-16 11:51:47,354 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 26 treesize of output 28 [2022-11-16 11:51:47,545 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-16 11:51:47,553 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:47,553 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 48 treesize of output 27 [2022-11-16 11:51:47,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-16 11:51:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:47,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:47,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3203 (Array Int Int))) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3201) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3202) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3203) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0))) is different from false [2022-11-16 11:51:47,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3203 (Array Int Int))) (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3201) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3202) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3203) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) 0))) is different from false [2022-11-16 11:51:48,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:48,073 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-11-16 11:51:48,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:48,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 78 [2022-11-16 11:51:48,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:48,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 125 [2022-11-16 11:51:48,466 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 78 treesize of output 58 [2022-11-16 11:51:48,511 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 30 treesize of output 22 [2022-11-16 11:51:49,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 11:51:49,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2022-11-16 11:51:49,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 64 [2022-11-16 11:51:49,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-16 11:51:49,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-16 11:51:49,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:49,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-11-16 11:51:49,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,168 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 41 treesize of output 33 [2022-11-16 11:51:49,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 11:51:49,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:49,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:51:49,246 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 7 treesize of output 3 [2022-11-16 11:51:49,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-16 11:51:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:51:51,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111363521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:51,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:51,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 22] total 49 [2022-11-16 11:51:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115704146] [2022-11-16 11:51:51,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:51,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 11:51:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 11:51:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1934, Unknown=27, NotChecked=182, Total=2352 [2022-11-16 11:51:51,874 INFO L87 Difference]: Start difference. First operand 654 states and 779 transitions. Second operand has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:53,912 INFO L93 Difference]: Finished difference Result 758 states and 900 transitions. [2022-11-16 11:51:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:51:53,912 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 11:51:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:53,923 INFO L225 Difference]: With dead ends: 758 [2022-11-16 11:51:53,923 INFO L226 Difference]: Without dead ends: 758 [2022-11-16 11:51:53,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 71 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=361, Invalid=2812, Unknown=27, NotChecked=222, Total=3422 [2022-11-16 11:51:53,924 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 398 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1632 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:53,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1543 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1189 Invalid, 0 Unknown, 1632 Unchecked, 1.0s Time] [2022-11-16 11:51:53,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-11-16 11:51:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 658. [2022-11-16 11:51:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 646 states have (on average 1.2136222910216719) internal successors, (784), 657 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 784 transitions. [2022-11-16 11:51:53,933 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 784 transitions. Word has length 51 [2022-11-16 11:51:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:53,933 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 784 transitions. [2022-11-16 11:51:53,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 784 transitions. [2022-11-16 11:51:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:51:53,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:53,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:53,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:54,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:54,142 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:51:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash -583799534, now seen corresponding path program 1 times [2022-11-16 11:51:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:54,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604482938] [2022-11-16 11:51:54,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:54,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:55,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:55,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604482938] [2022-11-16 11:51:55,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604482938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:55,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584418785] [2022-11-16 11:51:55,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:55,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:55,219 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:55,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-16 11:51:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:55,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-16 11:51:55,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:55,590 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:51:55,590 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-16 11:51:55,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:51:55,688 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-16 11:51:55,978 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:51:55,978 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 21 treesize of output 25 [2022-11-16 11:51:55,991 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 11 treesize of output 7 [2022-11-16 11:51:56,009 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:56,009 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 31 treesize of output 29 [2022-11-16 11:51:56,154 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:51:56,154 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 21 treesize of output 25 [2022-11-16 11:51:56,159 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 11 treesize of output 7 [2022-11-16 11:51:56,174 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-16 11:51:56,196 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:56,196 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 31 treesize of output 29 [2022-11-16 11:51:56,324 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 11:51:56,324 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 20 treesize of output 22 [2022-11-16 11:51:56,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:51:56,460 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 11:51:56,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2022-11-16 11:51:56,483 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 28 treesize of output 23 [2022-11-16 11:51:56,799 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:51:56,799 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 74 [2022-11-16 11:51:56,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:56,805 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 33 treesize of output 38 [2022-11-16 11:51:56,814 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 26 treesize of output 28 [2022-11-16 11:51:57,043 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:57,044 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 33 [2022-11-16 11:51:57,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:51:57,138 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-16 11:51:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:57,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:57,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3330 (Array Int Int)) (v_ArrVal_3331 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3330) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3331) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3329) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2022-11-16 11:51:57,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3330 (Array Int Int)) (v_ArrVal_3331 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3330) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3331) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3329) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2022-11-16 11:51:57,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3330 (Array Int Int)) (v_ArrVal_3331 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_3330) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3331) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3329) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)) is different from false [2022-11-16 11:51:57,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:57,621 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2022-11-16 11:51:57,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:57,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 70 [2022-11-16 11:51:57,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:57,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 131 [2022-11-16 11:51:57,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:57,670 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 97 [2022-11-16 11:51:57,679 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 45 treesize of output 27 [2022-11-16 11:51:57,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 11:51:57,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 11:51:57,749 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 30 treesize of output 22 [2022-11-16 11:51:58,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 11:51:58,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2022-11-16 11:51:58,529 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 70 treesize of output 62 [2022-11-16 11:51:58,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,541 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 72 treesize of output 56 [2022-11-16 11:51:58,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 11:51:58,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:58,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:51:58,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,745 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 20 [2022-11-16 11:51:58,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-16 11:51:58,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:58,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-11-16 11:51:58,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:58,783 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 41 treesize of output 33 [2022-11-16 11:51:59,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:59,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-16 11:52:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-16 11:52:01,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584418785] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:52:01,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:52:01,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 45 [2022-11-16 11:52:01,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004109124] [2022-11-16 11:52:01,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:01,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 11:52:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 11:52:01,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1524, Unknown=18, NotChecked=246, Total=1980 [2022-11-16 11:52:01,255 INFO L87 Difference]: Start difference. First operand 658 states and 784 transitions. Second operand has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:52:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:04,208 INFO L93 Difference]: Finished difference Result 800 states and 942 transitions. [2022-11-16 11:52:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:52:04,209 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 11:52:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:04,211 INFO L225 Difference]: With dead ends: 800 [2022-11-16 11:52:04,211 INFO L226 Difference]: Without dead ends: 800 [2022-11-16 11:52:04,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=436, Invalid=2863, Unknown=19, NotChecked=342, Total=3660 [2022-11-16 11:52:04,212 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 421 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1488 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:04,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1660 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1783 Invalid, 0 Unknown, 1488 Unchecked, 1.6s Time] [2022-11-16 11:52:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-11-16 11:52:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 658. [2022-11-16 11:52:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 646 states have (on average 1.2136222910216719) internal successors, (784), 657 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:52:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 784 transitions. [2022-11-16 11:52:04,225 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 784 transitions. Word has length 51 [2022-11-16 11:52:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:04,225 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 784 transitions. [2022-11-16 11:52:04,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:52:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 784 transitions. [2022-11-16 11:52:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:52:04,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:04,227 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:52:04,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:04,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-16 11:52:04,433 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:52:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash 450712335, now seen corresponding path program 1 times [2022-11-16 11:52:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:04,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463701819] [2022-11-16 11:52:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:52:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:04,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463701819] [2022-11-16 11:52:04,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463701819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:04,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002392093] [2022-11-16 11:52:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:04,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:04,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:04,916 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:04,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-16 11:52:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:05,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 11:52:05,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:05,344 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-16 11:52:05,401 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:52:05,401 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-16 11:52:05,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:52:05,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:05,476 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-16 11:52:05,533 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 20 treesize of output 8 [2022-11-16 11:52:05,647 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-16 11:52:05,684 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-16 11:52:05,703 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:52:05,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:52:05,757 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-16 11:52:05,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:52:05,809 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 20 treesize of output 8 [2022-11-16 11:52:05,916 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-16 11:52:05,989 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-16 11:52:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:52:06,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:06,750 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:52:06,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 11:52:06,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3453 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_80| Int) (v_ArrVal_3446 Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_80| |c_ULTIMATE.start_main_~p~0#1.base|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_3446)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_3450) |v_ULTIMATE.start_main_~t~0#1.base_80| v_ArrVal_3453) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2022-11-16 11:52:06,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:06,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-16 11:52:06,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:06,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 63 [2022-11-16 11:52:06,891 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 48 treesize of output 44 [2022-11-16 11:52:06,897 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 22 treesize of output 20 [2022-11-16 11:52:07,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:07,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-16 11:52:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-16 11:52:07,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002392093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:52:07,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:52:07,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 46 [2022-11-16 11:52:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532905069] [2022-11-16 11:52:07,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:07,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 11:52:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 11:52:07,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1722, Unknown=28, NotChecked=86, Total=2070 [2022-11-16 11:52:07,258 INFO L87 Difference]: Start difference. First operand 658 states and 784 transitions. Second operand has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:52:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:08,906 INFO L93 Difference]: Finished difference Result 683 states and 807 transitions. [2022-11-16 11:52:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-16 11:52:08,906 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 11:52:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:08,908 INFO L225 Difference]: With dead ends: 683 [2022-11-16 11:52:08,908 INFO L226 Difference]: Without dead ends: 683 [2022-11-16 11:52:08,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=545, Invalid=3463, Unknown=28, NotChecked=124, Total=4160 [2022-11-16 11:52:08,909 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 200 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 547 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:08,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 984 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 505 Invalid, 0 Unknown, 547 Unchecked, 0.4s Time] [2022-11-16 11:52:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-11-16 11:52:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 658. [2022-11-16 11:52:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 646 states have (on average 1.2120743034055728) internal successors, (783), 657 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:52:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 783 transitions. [2022-11-16 11:52:08,917 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 783 transitions. Word has length 51 [2022-11-16 11:52:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:08,918 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 783 transitions. [2022-11-16 11:52:08,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:52:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 783 transitions. [2022-11-16 11:52:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 11:52:08,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:08,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:52:08,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:09,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:09,126 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:52:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1013030303, now seen corresponding path program 1 times [2022-11-16 11:52:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:09,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950691524] [2022-11-16 11:52:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:52:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950691524] [2022-11-16 11:52:09,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950691524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:09,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123029851] [2022-11-16 11:52:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:09,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:09,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:09,784 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:09,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-16 11:52:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:10,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 11:52:10,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:10,462 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-16 11:52:10,744 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:10,744 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 42 treesize of output 43 [2022-11-16 11:52:11,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:11,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2022-11-16 11:52:11,689 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3527 Int) (|v_ULTIMATE.start_main_~p~0#1.base_246| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_246| 1))) (and (= |c_#valid| (store (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3527) |v_ULTIMATE.start_main_~p~0#1.base_246| 0)) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_246|) 0)))) is different from true [2022-11-16 11:52:11,731 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3527 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (|v_ULTIMATE.start_main_~p~0#1.base_246| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_246| 1))) (and (= (select .cse0 |ULTIMATE.start_main_~p~0#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_246|) 0) (= (store (store (store .cse0 |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3527) |v_ULTIMATE.start_main_~p~0#1.base_246| 0) |ULTIMATE.start_main_~p~0#1.base| 0) |c_#valid|)))) is different from true [2022-11-16 11:52:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-16 11:52:11,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:12,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3530 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3530) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-16 11:52:12,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3530 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3530) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-16 11:52:12,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3530 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_3530) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-16 11:52:12,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:12,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-16 11:52:12,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:52:12,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2022-11-16 11:52:12,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-11-16 11:52:14,206 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0)) (.cse7 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_695 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse6 v_arrayElimCell_695 0) v_antiDerIndex_entry0_1))) (not .cse7)))) (let ((.cse0 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_695 Int)) (let ((.cse9 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_693 Int)) (= .cse9 (select (store .cse6 v_arrayElimCell_693 0) v_antiDerIndex_entry0_1))) (= .cse9 (select (store .cse6 v_arrayElimCell_695 0) v_antiDerIndex_entry0_1))))) .cse3)) (.cse2 (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (store .cse6 |c_ULTIMATE.start_main_~t~0#1.base| 0))) (and (or .cse0 .cse1) (or .cse0 .cse2) .cse3 (or (let ((.cse5 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_693 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse6 v_arrayElimCell_693 0) v_antiDerIndex_entry0_1))))) (and (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse4 v_antiDerIndex_entry0_1))) (or .cse5 .cse2) (or .cse5 .cse1))) .cse7) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_695 Int)) (let ((.cse8 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse8 (select .cse4 v_antiDerIndex_entry0_1)) (= .cse8 (select (store .cse6 v_arrayElimCell_695 0) v_antiDerIndex_entry0_1))))))))) is different from false [2022-11-16 11:53:03,254 WARN L233 SmtUtils]: Spent 48.66s on a formula simplification. DAG size of input: 58 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:53:23,581 WARN L233 SmtUtils]: Spent 20.17s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:53:56,308 WARN L233 SmtUtils]: Spent 30.35s on a formula simplification. DAG size of input: 56 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:04,652 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-16 11:54:04,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123029851] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:54:04,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:54:04,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 47 [2022-11-16 11:54:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561130382] [2022-11-16 11:54:04,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 11:54:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 11:54:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1550, Unknown=8, NotChecked=510, Total=2256 [2022-11-16 11:54:04,722 INFO L87 Difference]: Start difference. First operand 658 states and 783 transitions. Second operand has 48 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:13,026 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 60 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:13,894 INFO L93 Difference]: Finished difference Result 682 states and 807 transitions. [2022-11-16 11:54:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:54:13,895 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-16 11:54:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:13,896 INFO L225 Difference]: With dead ends: 682 [2022-11-16 11:54:13,896 INFO L226 Difference]: Without dead ends: 677 [2022-11-16 11:54:13,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 122.1s TimeCoverageRelationStatistics Valid=272, Invalid=2500, Unknown=8, NotChecked=642, Total=3422 [2022-11-16 11:54:13,897 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 45 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:13,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 807 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 383 Unchecked, 0.1s Time] [2022-11-16 11:54:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-16 11:54:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 674. [2022-11-16 11:54:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 662 states have (on average 1.2069486404833838) internal successors, (799), 673 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 799 transitions. [2022-11-16 11:54:13,904 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 799 transitions. Word has length 52 [2022-11-16 11:54:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:13,904 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 799 transitions. [2022-11-16 11:54:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 799 transitions. [2022-11-16 11:54:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 11:54:13,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:13,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:13,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:14,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:14,105 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:54:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1014497547, now seen corresponding path program 1 times [2022-11-16 11:54:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:14,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079420330] [2022-11-16 11:54:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:14,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:14,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079420330] [2022-11-16 11:54:14,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079420330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:14,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562437315] [2022-11-16 11:54:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:14,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:14,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:14,904 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:14,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-16 11:54:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:15,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 11:54:15,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:15,546 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-16 11:54:15,830 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:54:15,830 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 42 treesize of output 43 [2022-11-16 11:54:16,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:54:16,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2022-11-16 11:54:16,630 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3606 Int) (|v_ULTIMATE.start_main_~p~0#1.base_254| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_254| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) 0) (= |c_#valid| (store (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3606) |v_ULTIMATE.start_main_~p~0#1.base_254| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_254|) 0)))) is different from true [2022-11-16 11:54:16,675 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3606 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (|v_ULTIMATE.start_main_~p~0#1.base_254| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_254| 1))) (and (= (select .cse0 |ULTIMATE.start_main_~p~0#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_254|) 0) (= |c_#valid| (store (store (store .cse0 |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3606) |v_ULTIMATE.start_main_~p~0#1.base_254| 0) |ULTIMATE.start_main_~p~0#1.base| 0))))) is different from true [2022-11-16 11:54:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-16 11:54:16,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:17,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3609 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_3609) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-16 11:54:17,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3609 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_3609) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-16 11:54:17,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3609 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_3609) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-16 11:54:17,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:54:17,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-16 11:54:17,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:54:17,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2022-11-16 11:54:17,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-11-16 11:54:55,788 WARN L233 SmtUtils]: Spent 22.28s on a formula simplification. DAG size of input: 44 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:55:20,140 WARN L233 SmtUtils]: Spent 24.12s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:55:46,441 WARN L233 SmtUtils]: Spent 24.13s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:56:21,064 WARN L233 SmtUtils]: Spent 32.19s on a formula simplification. DAG size of input: 54 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:56:27,398 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:56:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-16 11:56:27,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562437315] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:56:27,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:56:27,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 44 [2022-11-16 11:56:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141802832] [2022-11-16 11:56:27,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:56:27,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 11:56:27,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:56:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 11:56:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1417, Unknown=12, NotChecked=400, Total=1980 [2022-11-16 11:56:27,465 INFO L87 Difference]: Start difference. First operand 674 states and 799 transitions. Second operand has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:56:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:56:29,365 INFO L93 Difference]: Finished difference Result 697 states and 822 transitions. [2022-11-16 11:56:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:56:29,366 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-16 11:56:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:56:29,369 INFO L225 Difference]: With dead ends: 697 [2022-11-16 11:56:29,369 INFO L226 Difference]: Without dead ends: 692 [2022-11-16 11:56:29,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 132.6s TimeCoverageRelationStatistics Valid=283, Invalid=2695, Unknown=12, NotChecked=550, Total=3540 [2022-11-16 11:56:29,371 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 60 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 894 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:56:29,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1292 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 894 Unchecked, 0.3s Time] [2022-11-16 11:56:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-16 11:56:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 654. [2022-11-16 11:56:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 642 states have (on average 1.2118380062305296) internal successors, (778), 653 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:56:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 778 transitions. [2022-11-16 11:56:29,380 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 778 transitions. Word has length 52 [2022-11-16 11:56:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:56:29,380 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 778 transitions. [2022-11-16 11:56:29,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:56:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 778 transitions. [2022-11-16 11:56:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 11:56:29,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:56:29,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:56:29,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-16 11:56:29,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-16 11:56:29,582 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-16 11:56:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:56:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 22625035, now seen corresponding path program 2 times [2022-11-16 11:56:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:56:29,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839410941] [2022-11-16 11:56:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:56:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:56:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:56:29,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:56:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:56:29,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:56:29,654 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:56:29,655 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 45 remaining) [2022-11-16 11:56:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2022-11-16 11:56:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2022-11-16 11:56:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2022-11-16 11:56:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2022-11-16 11:56:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2022-11-16 11:56:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2022-11-16 11:56:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2022-11-16 11:56:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2022-11-16 11:56:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2022-11-16 11:56:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2022-11-16 11:56:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2022-11-16 11:56:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2022-11-16 11:56:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2022-11-16 11:56:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2022-11-16 11:56:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2022-11-16 11:56:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2022-11-16 11:56:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2022-11-16 11:56:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2022-11-16 11:56:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2022-11-16 11:56:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2022-11-16 11:56:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2022-11-16 11:56:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2022-11-16 11:56:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2022-11-16 11:56:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2022-11-16 11:56:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2022-11-16 11:56:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2022-11-16 11:56:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2022-11-16 11:56:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2022-11-16 11:56:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2022-11-16 11:56:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2022-11-16 11:56:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (13 of 45 remaining) [2022-11-16 11:56:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (12 of 45 remaining) [2022-11-16 11:56:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (11 of 45 remaining) [2022-11-16 11:56:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2022-11-16 11:56:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2022-11-16 11:56:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2022-11-16 11:56:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (7 of 45 remaining) [2022-11-16 11:56:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (6 of 45 remaining) [2022-11-16 11:56:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (5 of 45 remaining) [2022-11-16 11:56:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (4 of 45 remaining) [2022-11-16 11:56:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (3 of 45 remaining) [2022-11-16 11:56:29,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (2 of 45 remaining) [2022-11-16 11:56:29,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (1 of 45 remaining) [2022-11-16 11:56:29,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (0 of 45 remaining) [2022-11-16 11:56:29,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-16 11:56:29,669 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:56:29,674 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:56:29,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:56:29 BoogieIcfgContainer [2022-11-16 11:56:29,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:56:29,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:56:29,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:56:29,716 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:56:29,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:48:47" (3/4) ... [2022-11-16 11:56:29,719 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:56:29,797 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:56:29,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:56:29,798 INFO L158 Benchmark]: Toolchain (without parser) took 463259.77ms. Allocated memory was 113.2MB in the beginning and 302.0MB in the end (delta: 188.7MB). Free memory was 70.9MB in the beginning and 267.4MB in the end (delta: -196.5MB). Peak memory consumption was 167.7MB. Max. memory is 16.1GB. [2022-11-16 11:56:29,798 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:56:29,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.16ms. Allocated memory is still 113.2MB. Free memory was 70.7MB in the beginning and 80.8MB in the end (delta: -10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:56:29,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.58ms. Allocated memory is still 113.2MB. Free memory was 80.8MB in the beginning and 78.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:56:29,798 INFO L158 Benchmark]: Boogie Preprocessor took 30.10ms. Allocated memory is still 113.2MB. Free memory was 78.4MB in the beginning and 76.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:56:29,799 INFO L158 Benchmark]: RCFGBuilder took 619.72ms. Allocated memory is still 113.2MB. Free memory was 76.7MB in the beginning and 56.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 11:56:29,799 INFO L158 Benchmark]: TraceAbstraction took 461841.41ms. Allocated memory was 113.2MB in the beginning and 302.0MB in the end (delta: 188.7MB). Free memory was 55.7MB in the beginning and 95.9MB in the end (delta: -40.2MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. [2022-11-16 11:56:29,799 INFO L158 Benchmark]: Witness Printer took 81.44ms. Allocated memory is still 302.0MB. Free memory was 95.9MB in the beginning and 267.4MB in the end (delta: -171.5MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-11-16 11:56:29,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.16ms. Allocated memory is still 113.2MB. Free memory was 70.7MB in the beginning and 80.8MB in the end (delta: -10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.58ms. Allocated memory is still 113.2MB. Free memory was 80.8MB in the beginning and 78.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.10ms. Allocated memory is still 113.2MB. Free memory was 78.4MB in the beginning and 76.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 619.72ms. Allocated memory is still 113.2MB. Free memory was 76.7MB in the beginning and 56.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 461841.41ms. Allocated memory was 113.2MB in the beginning and 302.0MB in the end (delta: 188.7MB). Free memory was 55.7MB in the beginning and 95.9MB in the end (delta: -40.2MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. * Witness Printer took 81.44ms. Allocated memory is still 302.0MB. Free memory was 95.9MB in the beginning and 267.4MB in the end (delta: -171.5MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L567] List p, a, t; [L568] a = (List) malloc(sizeof(struct node)) [L569] COND FALSE !(a == 0) VAL [a={6:0}] [L570] a->n = 0 VAL [a={6:0}] [L571] p = a [L572] int i = 0; VAL [a={6:0}, i=0, p={6:0}] [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, a={6:0}, i=0, i < 20 && __VERIFIER_nondet_int()=1, p={6:0}] [L573] COND TRUE i < 20 && __VERIFIER_nondet_int() [L574] i++ [L575] p->flag = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={6:0}, i=1, p={6:0}] [L576] p->flag VAL [a={6:0}, i=1, p={6:0}, p->flag=0] [L576] COND FALSE !(p->flag) [L579] p->h = 2 VAL [a={6:0}, i=1, p={6:0}] [L581] t = (List) malloc(sizeof(struct node)) [L582] COND FALSE !(t == 0) VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L583] p->n = t VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L584] EXPR p->n VAL [a={6:0}, i=1, p={6:0}, p->n={5:0}, t={5:0}] [L584] p = p->n [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={6:0}, i=1, i < 20 && __VERIFIER_nondet_int()=0, p={5:0}, t={5:0}] [L573] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L586] p->h = 3 VAL [a={6:0}, i=1, p={5:0}, t={5:0}] [L587] p = a VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L588] EXPR p->h VAL [a={6:0}, i=1, p={6:0}, p->h=2, t={5:0}] [L588] COND TRUE p->h != 3 [L589] p->flag VAL [a={6:0}, i=1, p={6:0}, p->flag=0, t={5:0}] [L589] COND FALSE !(p->flag) [L593] EXPR p->h VAL [a={6:0}, i=1, p={6:0}, p->h=2, t={5:0}] [L593] COND FALSE !(p->h != 2) [L596] EXPR p->n VAL [a={6:0}, i=1, p={6:0}, p->n={5:0}, t={5:0}] [L596] p = p->n [L597] i++ VAL [a={6:0}, i=2, p={5:0}, t={5:0}] [L588] EXPR p->h VAL [a={6:0}, i=2, p={5:0}, p->h=3, t={5:0}] [L588] COND FALSE !(p->h != 3) [L599] EXPR p->h VAL [a={6:0}, i=2, p={5:0}, p->h=3, t={5:0}] [L599] COND FALSE !(p->h != 3 || i > 20) [L601] p = a VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L602] COND FALSE !(p == 0) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L605] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L605] COND FALSE !(p->n == 0) [L610] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L611] t = p->n [L612] free(p) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L612] free(p) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L612] free(p) [L613] p = t VAL [a={6:0}, i=2, p={5:0}, t={5:0}] [L610] EXPR p->n VAL [a={6:0}, i=2, p={5:0}, p->n={49:59}, t={5:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={6:0}, i=2, p={5:0}, p->n={49:59}, t={5:0}] [L611] t = p->n [L612] free(p) VAL [a={6:0}, i=2, p={5:0}, t={49:59}] [L612] free(p) VAL [a={6:0}, i=2, p={5:0}, t={49:59}] [L612] free(p) [L613] p = t VAL [a={6:0}, i=2, p={49:59}, t={49:59}] [L610] p->n - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 461.7s, OverallIterations: 49, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 76.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15716 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15716 mSDsluCounter, 36845 SdHoareTripleChecker+Invalid, 20.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28307 IncrementalHoareTripleChecker+Unchecked, 33688 mSDsCounter, 1494 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27910 IncrementalHoareTripleChecker+Invalid, 57711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1494 mSolverCounterUnsat, 3157 mSDtfsCounter, 27910 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4336 GetRequests, 2280 SyntacticMatches, 165 SemanticMatches, 1891 ConstructedPredicates, 72 IntricatePredicates, 9 DeprecatedPredicates, 29872 ImplicationChecksByTransitivity, 349.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=39, InterpolantAutomatonStates: 966, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 48 MinimizatonAttempts, 3869 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 369.0s InterpolantComputationTime, 3302 NumberOfCodeBlocks, 3302 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 4620 ConstructedInterpolants, 1029 QuantifiedInterpolants, 91953 SizeOfPredicates, 540 NumberOfNonLiveVariables, 9705 ConjunctsInSsa, 1537 ConjunctsInUnsatCore, 119 InterpolantComputations, 13 PerfectInterpolantSequences, 73/1281 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:56:29,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af68fcf0-0725-4edd-8c61-3f761a1b8f2a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)