./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:34:07,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:34:07,621 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-11-23 20:34:07,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:34:07,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:34:07,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:34:07,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:34:07,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:34:07,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:34:07,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:34:07,686 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:34:07,687 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:34:07,688 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:34:07,689 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:34:07,690 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:34:07,690 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:34:07,691 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:34:07,700 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:34:07,701 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:34:07,701 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:34:07,702 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:34:07,702 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:34:07,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:34:07,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:34:07,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:34:07,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:34:07,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:34:07,706 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 20:34:07,706 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 20:34:07,707 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 20:34:07,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:34:07,709 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 20:34:07,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:34:07,709 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:34:07,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:34:07,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:34:07,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:34:07,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:34:07,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:34:07,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:34:07,711 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:34:07,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:34:07,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:34:07,712 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:34:07,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:34:07,713 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/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_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 [2023-11-23 20:34:08,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:34:08,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:34:08,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:34:08,080 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:34:08,081 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:34:08,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2023-11-23 20:34:11,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:34:11,590 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:34:11,591 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2023-11-23 20:34:11,626 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/data/eea235c2b/a014027984cf493b81f3737480fd3d13/FLAG393319162 [2023-11-23 20:34:11,649 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/data/eea235c2b/a014027984cf493b81f3737480fd3d13 [2023-11-23 20:34:11,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:34:11,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:34:11,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:34:11,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:34:11,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:34:11,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:34:11" (1/1) ... [2023-11-23 20:34:11,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3adbf43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:11, skipping insertion in model container [2023-11-23 20:34:11,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:34:11" (1/1) ... [2023-11-23 20:34:11,767 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:34:12,051 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-23 20:34:12,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:34:12,261 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:34:12,331 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-23 20:34:12,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:34:12,394 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:34:12,403 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:34:12,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12 WrapperNode [2023-11-23 20:34:12,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:34:12,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:34:12,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:34:12,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:34:12,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,453 INFO L138 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2023-11-23 20:34:12,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:34:12,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:34:12,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:34:12,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:34:12,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:34:12,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:34:12,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:34:12,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:34:12,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (1/1) ... [2023-11-23 20:34:12,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:34:12,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:34:12,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:34:12,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:34:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure loop_internal [2023-11-23 20:34:12,626 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_internal [2023-11-23 20:34:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2023-11-23 20:34:12,626 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2023-11-23 20:34:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2023-11-23 20:34:12,629 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2023-11-23 20:34:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-11-23 20:34:12,629 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-11-23 20:34:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 20:34:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 20:34:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_internal [2023-11-23 20:34:12,630 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_internal [2023-11-23 20:34:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 20:34:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:34:12,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:34:12,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:34:12,824 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:34:12,827 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:34:13,332 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:34:13,432 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:34:13,433 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-23 20:34:13,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:34:13 BoogieIcfgContainer [2023-11-23 20:34:13,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:34:13,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:34:13,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:34:13,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:34:13,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:34:11" (1/3) ... [2023-11-23 20:34:13,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250c461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:34:13, skipping insertion in model container [2023-11-23 20:34:13,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:34:12" (2/3) ... [2023-11-23 20:34:13,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250c461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:34:13, skipping insertion in model container [2023-11-23 20:34:13,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:34:13" (3/3) ... [2023-11-23 20:34:13,445 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-twice.i [2023-11-23 20:34:13,462 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:34:13,462 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2023-11-23 20:34:13,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:34:13,518 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;@7f2a8f0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:34:13,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-11-23 20:34:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 50 states have (on average 2.18) internal successors, (109), 101 states have internal predecessors, (109), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 20:34:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-23 20:34:13,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:13,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-23 20:34:13,530 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:13,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 8271905, now seen corresponding path program 1 times [2023-11-23 20:34:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693043759] [2023-11-23 20:34:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:13,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:13,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693043759] [2023-11-23 20:34:13,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693043759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:34:13,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:34:13,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:34:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863270664] [2023-11-23 20:34:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:34:13,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:34:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:13,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:34:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:34:13,857 INFO L87 Difference]: Start difference. First operand has 119 states, 50 states have (on average 2.18) internal successors, (109), 101 states have internal predecessors, (109), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:34:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:14,123 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2023-11-23 20:34:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:34:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-23 20:34:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:14,138 INFO L225 Difference]: With dead ends: 116 [2023-11-23 20:34:14,138 INFO L226 Difference]: Without dead ends: 115 [2023-11-23 20:34:14,140 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 [2023-11-23 20:34:14,144 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:14,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:34:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-23 20:34:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-23 20:34:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 50 states have (on average 2.06) internal successors, (103), 97 states have internal predecessors, (103), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 20:34:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2023-11-23 20:34:14,227 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 4 [2023-11-23 20:34:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:14,228 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2023-11-23 20:34:14,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:34:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2023-11-23 20:34:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-23 20:34:14,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:14,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-23 20:34:14,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:34:14,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:14,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 8271906, now seen corresponding path program 1 times [2023-11-23 20:34:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242583876] [2023-11-23 20:34:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:14,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242583876] [2023-11-23 20:34:14,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242583876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:34:14,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:34:14,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:34:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459166137] [2023-11-23 20:34:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:34:14,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:34:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:34:14,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:34:14,389 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:34:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:14,514 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-11-23 20:34:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:34:14,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-23 20:34:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:14,517 INFO L225 Difference]: With dead ends: 112 [2023-11-23 20:34:14,518 INFO L226 Difference]: Without dead ends: 112 [2023-11-23 20:34:14,518 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 [2023-11-23 20:34:14,520 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:14,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 173 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:34:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-23 20:34:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-23 20:34:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 50 states have (on average 2.0) internal successors, (100), 94 states have internal predecessors, (100), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 20:34:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-11-23 20:34:14,536 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 4 [2023-11-23 20:34:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:14,537 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-11-23 20:34:14,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:34:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-11-23 20:34:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 20:34:14,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:14,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:34:14,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:34:14,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:14,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1691344441, now seen corresponding path program 1 times [2023-11-23 20:34:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:14,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308782722] [2023-11-23 20:34:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:14,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:14,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308782722] [2023-11-23 20:34:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308782722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:34:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:34:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:34:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542668053] [2023-11-23 20:34:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:34:14,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:34:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:14,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:34:14,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:34:14,658 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:34:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:14,761 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2023-11-23 20:34:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:34:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-23 20:34:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:14,763 INFO L225 Difference]: With dead ends: 111 [2023-11-23 20:34:14,764 INFO L226 Difference]: Without dead ends: 111 [2023-11-23 20:34:14,764 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 [2023-11-23 20:34:14,766 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:14,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 167 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:34:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-23 20:34:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-23 20:34:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 50 states have (on average 1.98) internal successors, (99), 93 states have internal predecessors, (99), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 20:34:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2023-11-23 20:34:14,781 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 12 [2023-11-23 20:34:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:14,783 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2023-11-23 20:34:14,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:34:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2023-11-23 20:34:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 20:34:14,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:14,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:34:14,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 20:34:14,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:14,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1691344442, now seen corresponding path program 1 times [2023-11-23 20:34:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:14,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810945685] [2023-11-23 20:34:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:14,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810945685] [2023-11-23 20:34:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810945685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:34:14,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:34:14,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:34:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857043088] [2023-11-23 20:34:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:34:14,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:34:14,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:34:14,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:34:14,916 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:34:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:15,047 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2023-11-23 20:34:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:34:15,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-23 20:34:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:15,051 INFO L225 Difference]: With dead ends: 110 [2023-11-23 20:34:15,052 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 20:34:15,052 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 [2023-11-23 20:34:15,064 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:15,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 172 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:34:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 20:34:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-23 20:34:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 50 states have (on average 1.96) internal successors, (98), 92 states have internal predecessors, (98), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 20:34:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2023-11-23 20:34:15,083 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 12 [2023-11-23 20:34:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:15,084 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2023-11-23 20:34:15,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:34:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2023-11-23 20:34:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 20:34:15,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:15,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:34:15,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 20:34:15,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:15,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2072795497, now seen corresponding path program 1 times [2023-11-23 20:34:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:15,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477784691] [2023-11-23 20:34:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:15,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477784691] [2023-11-23 20:34:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477784691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:34:15,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:34:15,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 20:34:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646419050] [2023-11-23 20:34:15,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:34:15,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 20:34:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:15,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 20:34:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:34:15,681 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:34:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:16,301 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2023-11-23 20:34:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 20:34:16,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-11-23 20:34:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:16,306 INFO L225 Difference]: With dead ends: 145 [2023-11-23 20:34:16,306 INFO L226 Difference]: Without dead ends: 145 [2023-11-23 20:34:16,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-23 20:34:16,314 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 60 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:16,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 296 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 20:34:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-23 20:34:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2023-11-23 20:34:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 62 states have (on average 1.935483870967742) internal successors, (120), 100 states have internal predecessors, (120), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2023-11-23 20:34:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2023-11-23 20:34:16,351 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 19 [2023-11-23 20:34:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:16,352 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2023-11-23 20:34:16,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:34:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2023-11-23 20:34:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 20:34:16,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:16,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:34:16,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 20:34:16,356 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:16,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2072795496, now seen corresponding path program 1 times [2023-11-23 20:34:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:16,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995696244] [2023-11-23 20:34:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:16,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:16,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995696244] [2023-11-23 20:34:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995696244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:34:16,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:34:16,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 20:34:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269499571] [2023-11-23 20:34:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:34:16,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 20:34:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:16,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 20:34:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 20:34:16,899 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:34:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:17,732 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2023-11-23 20:34:17,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 20:34:17,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-11-23 20:34:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:17,735 INFO L225 Difference]: With dead ends: 153 [2023-11-23 20:34:17,735 INFO L226 Difference]: Without dead ends: 153 [2023-11-23 20:34:17,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-23 20:34:17,737 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 45 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:17,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 360 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 20:34:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-23 20:34:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 136. [2023-11-23 20:34:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 109 states have internal predecessors, (133), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (24), 21 states have call predecessors, (24), 17 states have call successors, (24) [2023-11-23 20:34:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2023-11-23 20:34:17,770 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 19 [2023-11-23 20:34:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:17,771 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2023-11-23 20:34:17,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:34:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2023-11-23 20:34:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 20:34:17,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:17,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:34:17,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 20:34:17,775 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:17,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash 947437139, now seen corresponding path program 1 times [2023-11-23 20:34:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:17,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490842856] [2023-11-23 20:34:17,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:18,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490842856] [2023-11-23 20:34:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490842856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131690780] [2023-11-23 20:34:18,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:18,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:34:18,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:34:18,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:34:18,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 20:34:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:18,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-23 20:34:18,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:34:18,218 INFO L378 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 [2023-11-23 20:34:18,283 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2023-11-23 20:34:18,313 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 20:34:18,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 20:34:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-23 20:34:18,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:34:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131690780] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:34:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1985801973] [2023-11-23 20:34:18,572 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-23 20:34:18,572 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:34:18,577 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 20:34:18,583 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 20:34:18,583 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 20:34:18,800 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 55 for LOIs [2023-11-23 20:34:19,314 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 99 for LOIs [2023-11-23 20:34:19,442 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-23 20:34:19,473 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 20:34:23,823 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1750#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (or (and (exists ((|v_#valid_132| (Array Int Int)) (|v_#length_108| (Array Int Int)) (|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| Int)) (and (= (select |v_#valid_132| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0) (= |old(#length)| (store |v_#length_108| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 24)) (= |old(#valid)| (store |v_#valid_132| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0) 16 0)) |old(#memory_$Pointer$.base)|) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 0)) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (store (select |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0) 16 0))))) (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_116| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_116| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| 0) 0)) (exists ((|v_#length_110| (Array Int Int))) (= |#length| (store |v_#length_110| |create_internal_#t~ret7.base| 8))) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_create_internal_#t~nondet6_7| Int)) (and (not (= |v_create_internal_#t~nondet6_7| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_7| 2147483648)) (<= |v_create_internal_#t~nondet6_7| 2147483647))) (not (= create_internal_~sll~0.base 0)) (= create_internal_~now~0.base create_internal_~sll~0.base) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_134| (Array Int Int))) (= (select |v_#valid_134| create_internal_~sll~0.base) 0)) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_115| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_115| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_#valid_133| (Array Int Int))) (and (= (store |v_#valid_133| |create_internal_#t~ret7.base| 1) |#valid|) (= (select |v_#valid_133| |create_internal_#t~ret7.base|) 0)))) (and (exists ((|v_#valid_132| (Array Int Int)) (|v_#length_108| (Array Int Int)) (|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| Int)) (and (= (select |v_#valid_132| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0) (= |old(#length)| (store |v_#length_108| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 24)) (= |old(#valid)| (store |v_#valid_132| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0) 16 0)) |old(#memory_$Pointer$.base)|) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 0)) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (store (select |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0) 16 0))))) (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#length_109| (Array Int Int))) (= |#length| (store |v_#length_109| |create_internal_#t~ret7.base| 8))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| 0) 0)) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_create_internal_#t~nondet6_7| Int)) (and (not (= |v_create_internal_#t~nondet6_7| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_7| 2147483648)) (<= |v_create_internal_#t~nondet6_7| 2147483647))) (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_115| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_#valid_135| (Array Int Int))) (= (select |v_#valid_135| create_internal_~sll~0.base) 0)) (not (= create_internal_~sll~0.base 0)) (= create_internal_~now~0.base create_internal_~sll~0.base) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_115| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_115| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_#valid_133| (Array Int Int))) (and (= (store |v_#valid_133| |create_internal_#t~ret7.base| 1) |#valid|) (= (select |v_#valid_133| |create_internal_#t~ret7.base|) 0))))) (= create_internal_~now~0.offset 0) (not (= (select |#valid| create_internal_~now~0.base) 1)) (= |create_internal_#t~ret7.offset| 0))' at error location [2023-11-23 20:34:23,824 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 20:34:23,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:34:23,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 10 [2023-11-23 20:34:23,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869177122] [2023-11-23 20:34:23,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:34:23,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 20:34:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:23,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 20:34:23,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=613, Unknown=1, NotChecked=50, Total=756 [2023-11-23 20:34:23,826 INFO L87 Difference]: Start difference. First operand 136 states and 174 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 20:34:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:24,492 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2023-11-23 20:34:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 20:34:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 21 [2023-11-23 20:34:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:24,495 INFO L225 Difference]: With dead ends: 149 [2023-11-23 20:34:24,495 INFO L226 Difference]: Without dead ends: 149 [2023-11-23 20:34:24,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=124, Invalid=871, Unknown=1, NotChecked=60, Total=1056 [2023-11-23 20:34:24,497 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 85 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:24,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 348 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 439 Invalid, 0 Unknown, 143 Unchecked, 0.4s Time] [2023-11-23 20:34:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-23 20:34:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2023-11-23 20:34:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 109 states have internal predecessors, (134), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2023-11-23 20:34:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 177 transitions. [2023-11-23 20:34:24,507 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 177 transitions. Word has length 21 [2023-11-23 20:34:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:24,507 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 177 transitions. [2023-11-23 20:34:24,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 20:34:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 177 transitions. [2023-11-23 20:34:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 20:34:24,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:24,509 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:34:24,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 20:34:24,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-23 20:34:24,727 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:24,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash 947437140, now seen corresponding path program 1 times [2023-11-23 20:34:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:24,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426396293] [2023-11-23 20:34:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:34:24,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426396293] [2023-11-23 20:34:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426396293] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934288044] [2023-11-23 20:34:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:34:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:34:24,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:34:25,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 20:34:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:25,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 20:34:25,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:34:25,105 INFO L378 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 [2023-11-23 20:34:25,143 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2023-11-23 20:34:25,159 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 20:34:25,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 20:34:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-23 20:34:25,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:34:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934288044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:25,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [88791597] [2023-11-23 20:34:25,259 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-23 20:34:25,259 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:34:25,259 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 20:34:25,259 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 20:34:25,259 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 20:34:25,343 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 53 for LOIs [2023-11-23 20:34:25,667 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 95 for LOIs [2023-11-23 20:34:25,743 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-23 20:34:25,764 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 20:34:29,362 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2141#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (or (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#valid_143| (Array Int Int))) (= (select |v_#valid_143| create_internal_~sll~0.base) 0)) (exists ((|v_#valid_144| (Array Int Int))) (and (= (store |v_#valid_144| |create_internal_#t~ret7.base| 1) |#valid|) (= (select |v_#valid_144| |create_internal_#t~ret7.base|) 0))) (exists ((|v_create_internal_#t~nondet6_8| Int)) (and (not (= |v_create_internal_#t~nondet6_8| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_8| 2147483648)) (<= |v_create_internal_#t~nondet6_8| 2147483647))) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| |create_internal_#t~ret7.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_130| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#valid_142| (Array Int Int)) (|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| Int) (|v_#length_122| (Array Int Int))) (and (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0) 16 0)) |old(#memory_$Pointer$.base)|) (= (select |v_#valid_142| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0) (= |old(#valid)| (store |v_#valid_142| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1)) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 0)) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0) 16 0))) (= (store |v_#length_122| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 24) |old(#length)|) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|))) (not (= create_internal_~sll~0.base 0)) (= create_internal_~now~0.base create_internal_~sll~0.base) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_130| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_130| |create_internal_#t~ret7.base|) 0 0))))) (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#valid_143| (Array Int Int))) (and (= |#valid| (store |v_#valid_143| |create_internal_#t~ret7.base| 1)) (= (select |v_#valid_143| |create_internal_#t~ret7.base|) 0))) (exists ((|v_#length_125| (Array Int Int))) (= (store |v_#length_125| |create_internal_#t~ret7.base| 8) |#length|)) (exists ((|v_#valid_145| (Array Int Int))) (= (select |v_#valid_145| create_internal_~sll~0.base) 0)) (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_131| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_131| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_create_internal_#t~nondet6_8| Int)) (and (not (= |v_create_internal_#t~nondet6_8| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_8| 2147483648)) (<= |v_create_internal_#t~nondet6_8| 2147483647))) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_129| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_129| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#valid_142| (Array Int Int)) (|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| Int) (|v_#length_122| (Array Int Int))) (and (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0) 16 0)) |old(#memory_$Pointer$.base)|) (= (select |v_#valid_142| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0) (= |old(#valid)| (store |v_#valid_142| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1)) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 0)) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0) 16 0))) (= (store |v_#length_122| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 24) |old(#length)|) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|))) (not (= create_internal_~sll~0.base 0)) (= create_internal_~now~0.base create_internal_~sll~0.base) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|))) (= create_internal_~now~0.offset 0) (<= (select |#length| create_internal_~now~0.base) 7) (= |create_internal_#t~ret7.offset| 0))' at error location [2023-11-23 20:34:29,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 20:34:29,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:34:29,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2023-11-23 20:34:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185259757] [2023-11-23 20:34:29,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:34:29,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 20:34:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:29,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 20:34:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2023-11-23 20:34:29,364 INFO L87 Difference]: Start difference. First operand 137 states and 177 transitions. Second operand has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 20:34:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:29,907 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2023-11-23 20:34:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 20:34:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-23 20:34:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:29,909 INFO L225 Difference]: With dead ends: 138 [2023-11-23 20:34:29,909 INFO L226 Difference]: Without dead ends: 138 [2023-11-23 20:34:29,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=108, Invalid=887, Unknown=1, NotChecked=60, Total=1056 [2023-11-23 20:34:29,910 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 28 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:29,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 338 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 469 Invalid, 0 Unknown, 130 Unchecked, 0.3s Time] [2023-11-23 20:34:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-23 20:34:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2023-11-23 20:34:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 110 states have internal predecessors, (134), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2023-11-23 20:34:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 177 transitions. [2023-11-23 20:34:29,918 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 177 transitions. Word has length 21 [2023-11-23 20:34:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:29,919 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 177 transitions. [2023-11-23 20:34:29,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 20:34:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 177 transitions. [2023-11-23 20:34:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 20:34:29,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:29,920 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] [2023-11-23 20:34:29,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 20:34:30,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-23 20:34:30,135 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:30,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1631406481, now seen corresponding path program 1 times [2023-11-23 20:34:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:30,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857887623] [2023-11-23 20:34:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:34:30,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:30,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857887623] [2023-11-23 20:34:30,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857887623] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:30,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867872327] [2023-11-23 20:34:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:34:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:34:30,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:34:30,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 20:34:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:30,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-23 20:34:30,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:34:30,842 INFO L378 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 [2023-11-23 20:34:30,923 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2023-11-23 20:34:30,958 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)) |v_#valid_BEFORE_CALL_40|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2023-11-23 20:34:30,961 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)) |v_#valid_BEFORE_CALL_40|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2023-11-23 20:34:30,987 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2023-11-23 20:34:30,989 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2023-11-23 20:34:31,099 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 20:34:31,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 20:34:31,122 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_23| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0))) (= (select |c_#valid| .cse0) 1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from false [2023-11-23 20:34:31,124 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_23| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0))) (= (select |c_#valid| .cse0) 1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from true [2023-11-23 20:34:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-23 20:34:31,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:34:31,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867872327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:31,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1346385405] [2023-11-23 20:34:31,384 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-11-23 20:34:31,384 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:34:31,385 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 20:34:31,385 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 20:34:31,385 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 20:34:32,540 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 57 for LOIs [2023-11-23 20:34:33,916 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2023-11-23 20:34:33,948 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-23 20:34:33,966 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 20:34:38,842 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2568#(and (not (= (select |#valid| |ULTIMATE.start_create_~now~1#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (or (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (not (= |ULTIMATE.start_create_#t~ret10#1.base| 0)) (exists ((|v_#valid_175| (Array Int Int))) (and (= |#valid| (store |v_#valid_175| |ULTIMATE.start_create_#t~ret10#1.base| 1)) (= (select |v_#valid_175| |ULTIMATE.start_create_#t~ret10#1.base|) 0))) (exists ((|v_#length_144| (Array Int Int))) (= |#length| (store |v_#length_144| |ULTIMATE.start_create_#t~ret10#1.base| 8))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_174| (Array Int Int))) (= (select |v_#valid_174| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (exists ((|v_#memory_$Pointer$.offset_156| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_156| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.offset_156| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)))) (exists ((|v_#memory_$Pointer$.base_156| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_156| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.base_156| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_create_#t~ret10#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_~now~1#1.base| |ULTIMATE.start_create_~sll~1#1.base|)) (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_174| (Array Int Int))) (= (select |v_#valid_174| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (exists ((|v_#valid_175| (Array Int Int)) (v_create_internal_~now~0.base_24 Int) (|v_#memory_$Pointer$.base_156| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_156| (Array Int (Array Int Int))) (v_create_internal_~now~0.offset_22 Int) (|v_#length_144| (Array Int Int))) (and (<= (+ v_create_internal_~now~0.offset_22 8) (select |#length| v_create_internal_~now~0.base_24)) (not (= (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22) 0)) (<= 0 v_create_internal_~now~0.offset_22) (= 0 (select |v_#valid_175| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22))) (= |#length| (store |v_#length_144| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22) 8)) (= (select |#valid| v_create_internal_~now~0.base_24) 1) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22) (store (select |v_#memory_$Pointer$.base_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22)) 0 0)) v_create_internal_~now~0.base_24 (store (select (store |v_#memory_$Pointer$.base_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22) (store (select |v_#memory_$Pointer$.base_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22)) 0 0)) v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22 (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22)))) (= (store |v_#valid_175| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22) 1) |#valid|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22) (store (select |v_#memory_$Pointer$.offset_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22)) 0 0)) v_create_internal_~now~0.base_24 (store (select (store |v_#memory_$Pointer$.offset_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22) (store (select |v_#memory_$Pointer$.offset_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22)) 0 0)) v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22 0))) (<= (+ (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_24) v_create_internal_~now~0.offset_22) 1) |#StackHeapBarrier|))) (= |ULTIMATE.start_create_~now~1#1.base| |ULTIMATE.start_create_~sll~1#1.base|))) (= |ULTIMATE.start_create_~now~1#1.offset| 0) (= |ULTIMATE.start_create_~sll~1#1.offset| 0))' at error location [2023-11-23 20:34:38,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 20:34:38,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:34:38,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17 [2023-11-23 20:34:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204717954] [2023-11-23 20:34:38,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:34:38,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 20:34:38,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 20:34:38,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1218, Unknown=7, NotChecked=300, Total=1722 [2023-11-23 20:34:38,846 INFO L87 Difference]: Start difference. First operand 138 states and 177 transitions. Second operand has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 20:34:39,285 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)) |v_#valid_BEFORE_CALL_40|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2023-11-23 20:34:39,290 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)) |v_#valid_BEFORE_CALL_40|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2023-11-23 20:34:39,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2023-11-23 20:34:39,303 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2023-11-23 20:34:39,315 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1))) (= (select |c_#valid| .cse1) 1)))))) (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))))) is different from false [2023-11-23 20:34:39,318 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1))) (= (select |c_#valid| .cse1) 1)))))) (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))))) is different from true [2023-11-23 20:34:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:39,813 INFO L93 Difference]: Finished difference Result 165 states and 210 transitions. [2023-11-23 20:34:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 20:34:39,814 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-11-23 20:34:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:39,817 INFO L225 Difference]: With dead ends: 165 [2023-11-23 20:34:39,817 INFO L226 Difference]: Without dead ends: 165 [2023-11-23 20:34:39,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=279, Invalid=1628, Unknown=13, NotChecked=630, Total=2550 [2023-11-23 20:34:39,822 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 874 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:39,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 363 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 636 Invalid, 0 Unknown, 874 Unchecked, 0.6s Time] [2023-11-23 20:34:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-23 20:34:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2023-11-23 20:34:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 77 states have (on average 1.8181818181818181) internal successors, (140), 114 states have internal predecessors, (140), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) [2023-11-23 20:34:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 190 transitions. [2023-11-23 20:34:39,836 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 190 transitions. Word has length 27 [2023-11-23 20:34:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:39,836 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 190 transitions. [2023-11-23 20:34:39,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 20:34:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 190 transitions. [2023-11-23 20:34:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 20:34:39,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:39,838 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] [2023-11-23 20:34:39,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 20:34:40,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 20:34:40,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:40,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1631406480, now seen corresponding path program 1 times [2023-11-23 20:34:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518142885] [2023-11-23 20:34:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:34:40,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518142885] [2023-11-23 20:34:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518142885] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227904024] [2023-11-23 20:34:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:40,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:34:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:34:40,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:34:40,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 20:34:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:40,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 20:34:40,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:34:40,946 INFO L378 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 8 treesize of output 1 [2023-11-23 20:34:40,950 INFO L378 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 [2023-11-23 20:34:41,202 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-23 20:34:41,231 WARN L876 $PredicateComparison]: unable to prove that (exists ((create_internal_~now~0.base Int) (alloc_and_zero_internal_~pi~1.base Int)) (and (= (store (store |c_old(#length)| create_internal_~now~0.base (select |c_#length| create_internal_~now~0.base)) alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (= (select (store |c_old(#valid)| create_internal_~now~0.base 1) alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-23 20:34:41,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:34:41,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:34:41,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:34:41,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 9 [2023-11-23 20:34:41,315 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-23 20:34:41,315 INFO L378 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 20 treesize of output 22 [2023-11-23 20:34:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-23 20:34:41,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:34:41,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227904024] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:41,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1479397318] [2023-11-23 20:34:41,591 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-11-23 20:34:41,591 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:34:41,592 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 20:34:41,592 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 20:34:41,592 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 20:34:42,637 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 57 for LOIs [2023-11-23 20:34:43,889 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2023-11-23 20:34:43,915 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-23 20:34:43,928 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 20:34:48,944 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3022#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (<= (select |#length| |ULTIMATE.start_create_~now~1#1.base|) 15) (or (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (exists ((|v_#length_172| (Array Int Int)) (|v_#valid_202| (Array Int Int)) (|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int))) (v_create_internal_~now~0.base_36 Int) (|v_#memory_$Pointer$.base_188| (Array Int (Array Int Int))) (v_create_internal_~now~0.offset_34 Int)) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34) (store (select |v_#memory_$Pointer$.offset_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34)) 0 0)) v_create_internal_~now~0.base_36 (store (select (store |v_#memory_$Pointer$.offset_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34) (store (select |v_#memory_$Pointer$.offset_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34)) 0 0)) v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34 0))) (= (store |v_#length_172| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34) 8) |#length|) (not (= (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34) 0)) (<= (+ v_create_internal_~now~0.offset_34 8) (select |#length| v_create_internal_~now~0.base_36)) (<= (+ (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34) 1) |#StackHeapBarrier|) (= (select |v_#valid_202| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34)) 0) (= |#valid| (store |v_#valid_202| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34) 1)) (= (select |#valid| v_create_internal_~now~0.base_36) 1) (<= 0 v_create_internal_~now~0.offset_34) (= (store (store |v_#memory_$Pointer$.base_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34) (store (select |v_#memory_$Pointer$.base_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34)) 0 0)) v_create_internal_~now~0.base_36 (store (select (store |v_#memory_$Pointer$.base_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34) (store (select |v_#memory_$Pointer$.base_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34)) 0 0)) v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34 (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_36) v_create_internal_~now~0.offset_34))) |#memory_$Pointer$.base|))) (exists ((|v_#valid_201| (Array Int Int))) (= (select |v_#valid_201| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (= |ULTIMATE.start_create_~now~1#1.base| |ULTIMATE.start_create_~sll~1#1.base|)) (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_202| (Array Int Int))) (and (= (select |v_#valid_202| |ULTIMATE.start_create_#t~ret10#1.base|) 0) (= (store |v_#valid_202| |ULTIMATE.start_create_#t~ret10#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (not (= |ULTIMATE.start_create_#t~ret10#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_188| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.offset_188| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)))) (exists ((|v_#valid_201| (Array Int Int))) (= (select |v_#valid_201| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#length_172| (Array Int Int))) (= |#length| (store |v_#length_172| |ULTIMATE.start_create_#t~ret10#1.base| 8))) (<= (+ |ULTIMATE.start_create_#t~ret10#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_188| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_188| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.base_188| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_create_~now~1#1.base| |ULTIMATE.start_create_~sll~1#1.base|))) (= |ULTIMATE.start_create_~now~1#1.offset| 0) (= |ULTIMATE.start_create_~sll~1#1.offset| 0))' at error location [2023-11-23 20:34:48,944 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 20:34:48,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:34:48,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2023-11-23 20:34:48,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331118431] [2023-11-23 20:34:48,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:34:48,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-23 20:34:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-23 20:34:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1462, Unknown=2, NotChecked=158, Total=1806 [2023-11-23 20:34:48,947 INFO L87 Difference]: Start difference. First operand 143 states and 190 transitions. Second operand has 20 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-23 20:34:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:50,095 INFO L93 Difference]: Finished difference Result 185 states and 245 transitions. [2023-11-23 20:34:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 20:34:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 27 [2023-11-23 20:34:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:50,100 INFO L225 Difference]: With dead ends: 185 [2023-11-23 20:34:50,101 INFO L226 Difference]: Without dead ends: 185 [2023-11-23 20:34:50,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=225, Invalid=1760, Unknown=3, NotChecked=174, Total=2162 [2023-11-23 20:34:50,102 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 114 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:50,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 277 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 936 Invalid, 0 Unknown, 388 Unchecked, 0.8s Time] [2023-11-23 20:34:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-23 20:34:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 147. [2023-11-23 20:34:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 81 states have (on average 1.8518518518518519) internal successors, (150), 116 states have internal predecessors, (150), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2023-11-23 20:34:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2023-11-23 20:34:50,122 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 27 [2023-11-23 20:34:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:50,123 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2023-11-23 20:34:50,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-23 20:34:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2023-11-23 20:34:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 20:34:50,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:50,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:34:50,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 20:34:50,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 20:34:50,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:50,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash -79480789, now seen corresponding path program 1 times [2023-11-23 20:34:50,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:50,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121091368] [2023-11-23 20:34:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:34:50,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121091368] [2023-11-23 20:34:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121091368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835630115] [2023-11-23 20:34:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:50,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:34:50,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:34:50,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:34:50,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 20:34:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:50,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-23 20:34:50,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:34:50,750 INFO L378 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 [2023-11-23 20:34:50,760 INFO L378 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 15 treesize of output 1 [2023-11-23 20:34:50,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-23 20:34:50,785 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2023-11-23 20:34:50,809 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 20:34:50,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 20:34:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-23 20:34:50,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:34:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:34:50,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835630115] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:34:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1744589545] [2023-11-23 20:34:50,969 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-23 20:34:50,969 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:34:50,969 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 20:34:50,970 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 20:34:50,970 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 20:34:51,036 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 55 for LOIs [2023-11-23 20:34:52,107 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2023-11-23 20:34:52,131 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-23 20:34:52,145 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 20:34:55,019 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3564#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (exists ((|v_#valid_232| (Array Int Int))) (and (= (store |v_#valid_232| |create_internal_#t~ret7.base| 1) |#valid|) (= (select |v_#valid_232| |create_internal_#t~ret7.base|) 0))) (not (= (select |#valid| create_internal_~now~0.base) 1)) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#memory_$Pointer$.base_228| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_228| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_228| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_#memory_$Pointer$.offset_227| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_227| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_227| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_#length_196| (Array Int Int))) (= |#length| (store |v_#length_196| |create_internal_#t~ret7.base| 8))) (= |create_internal_#t~ret7.offset| 0) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|))' at error location [2023-11-23 20:34:55,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 20:34:55,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:34:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 11 [2023-11-23 20:34:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375803430] [2023-11-23 20:34:55,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:34:55,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 20:34:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:34:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 20:34:55,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=766, Unknown=1, NotChecked=56, Total=930 [2023-11-23 20:34:55,022 INFO L87 Difference]: Start difference. First operand 147 states and 200 transitions. Second operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 20:34:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:34:55,760 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2023-11-23 20:34:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 20:34:55,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 29 [2023-11-23 20:34:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:34:55,763 INFO L225 Difference]: With dead ends: 157 [2023-11-23 20:34:55,763 INFO L226 Difference]: Without dead ends: 157 [2023-11-23 20:34:55,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=145, Invalid=1118, Unknown=1, NotChecked=68, Total=1332 [2023-11-23 20:34:55,764 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 58 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:34:55,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 462 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 604 Invalid, 0 Unknown, 141 Unchecked, 0.5s Time] [2023-11-23 20:34:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-23 20:34:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2023-11-23 20:34:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 81 states have (on average 1.8395061728395061) internal successors, (149), 115 states have internal predecessors, (149), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2023-11-23 20:34:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2023-11-23 20:34:55,773 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 29 [2023-11-23 20:34:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:34:55,773 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2023-11-23 20:34:55,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 20:34:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2023-11-23 20:34:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 20:34:55,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:34:55,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:34:55,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 20:34:55,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 20:34:55,997 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-23 20:34:55,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:34:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash -79480788, now seen corresponding path program 1 times [2023-11-23 20:34:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:34:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907239641] [2023-11-23 20:34:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:55,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:34:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:34:56,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:34:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907239641] [2023-11-23 20:34:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907239641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271531435] [2023-11-23 20:34:56,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:34:56,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:34:56,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:34:56,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:34:56,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4637a877-7d56-4b7d-b793-ece96cc2f589/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 20:34:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:34:56,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-23 20:34:56,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:34:56,568 INFO L378 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 [2023-11-23 20:34:56,610 INFO L378 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 [2023-11-23 20:34:56,615 INFO L378 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 15 treesize of output 1 [2023-11-23 20:34:56,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-23 20:34:56,663 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2023-11-23 20:34:56,676 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 20:34:56,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 20:34:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-23 20:34:56,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:34:56,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271531435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:34:56,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1353561414] [2023-11-23 20:34:56,778 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-23 20:34:56,778 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:34:56,779 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 20:34:56,779 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 20:34:56,779 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 20:34:56,830 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 53 for LOIs [2023-11-23 20:34:57,842 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2023-11-23 20:34:57,872 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-23 20:34:57,890 INFO L180 IcfgInterpreter]: Interpretation finished