./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:55:54,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:55:55,066 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2023-11-06 20:55:55,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:55:55,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:55:55,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:55:55,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:55:55,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:55:55,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:55:55,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:55:55,135 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:55:55,137 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:55:55,137 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:55:55,139 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:55:55,140 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:55:55,140 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:55:55,140 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:55:55,141 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:55:55,142 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:55:55,142 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:55:55,143 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:55:55,143 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:55:55,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:55:55,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:55:55,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:55:55,146 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:55:55,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:55:55,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:55:55,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:55:55,148 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:55:55,149 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:55:55,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:55:55,150 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:55:55,150 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:55:55,151 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:55:55,151 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:55:55,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:55:55,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:55:55,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:55:55,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:55:55,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:55:55,153 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:55:55,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:55:55,153 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:55:55,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:55:55,154 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_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/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_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 [2023-11-06 20:55:55,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:55:55,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:55:55,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:55:55,548 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:55:55,549 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:55:55,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/forester-heap/sll-token-1.i [2023-11-06 20:55:58,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:55:59,030 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:55:59,031 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/sv-benchmarks/c/forester-heap/sll-token-1.i [2023-11-06 20:55:59,051 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/data/41fc66e1d/1be9df728d8041c1b77549419f6f023d/FLAG234f6b6df [2023-11-06 20:55:59,068 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/data/41fc66e1d/1be9df728d8041c1b77549419f6f023d [2023-11-06 20:55:59,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:55:59,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:55:59,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:55:59,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:55:59,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:55:59,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f9ebf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59, skipping insertion in model container [2023-11-06 20:55:59,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,168 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:55:59,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:55:59,525 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:55:59,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:55:59,606 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:55:59,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59 WrapperNode [2023-11-06 20:55:59,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:55:59,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:55:59,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:55:59,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:55:59,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,658 INFO L138 Inliner]: procedures = 119, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2023-11-06 20:55:59,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:55:59,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:55:59,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:55:59,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:55:59,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:55:59,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:55:59,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:55:59,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:55:59,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (1/1) ... [2023-11-06 20:55:59,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:55:59,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:55:59,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:55:59,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:55:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-06 20:55:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-06 20:55:59,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:55:59,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:55:59,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:55:59,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:55:59,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:55:59,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:55:59,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:55:59,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:55:59,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:55:59,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:56:00,053 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:56:00,058 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:56:00,487 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:56:00,561 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:56:00,570 INFO L302 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-06 20:56:00,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:56:00 BoogieIcfgContainer [2023-11-06 20:56:00,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:56:00,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:56:00,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:56:00,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:56:00,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:55:59" (1/3) ... [2023-11-06 20:56:00,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f2609b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:56:00, skipping insertion in model container [2023-11-06 20:56:00,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:59" (2/3) ... [2023-11-06 20:56:00,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f2609b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:56:00, skipping insertion in model container [2023-11-06 20:56:00,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:56:00" (3/3) ... [2023-11-06 20:56:00,583 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2023-11-06 20:56:00,605 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:56:00,606 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2023-11-06 20:56:00,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:56:00,689 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;@4be5a95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:56:00,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-11-06 20:56:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 105 states have internal predecessors, (130), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 20:56:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-06 20:56:00,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:00,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-06 20:56:00,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:00,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 9065, now seen corresponding path program 1 times [2023-11-06 20:56:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:00,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328318133] [2023-11-06 20:56:00,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:00,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:00,945 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-06 20:56:00,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328318133] [2023-11-06 20:56:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328318133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:00,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:00,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:56:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757865544] [2023-11-06 20:56:00,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:00,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:56:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:00,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:56:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:56:00,992 INFO L87 Difference]: Start difference. First operand has 113 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 105 states have internal predecessors, (130), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:01,135 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-11-06 20:56:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:56:01,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-06 20:56:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:01,147 INFO L225 Difference]: With dead ends: 122 [2023-11-06 20:56:01,147 INFO L226 Difference]: Without dead ends: 121 [2023-11-06 20:56:01,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-06 20:56:01,153 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 80 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:01,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 87 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:56:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-06 20:56:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2023-11-06 20:56:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 100 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2023-11-06 20:56:01,196 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 2 [2023-11-06 20:56:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:01,196 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2023-11-06 20:56:01,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2023-11-06 20:56:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-06 20:56:01,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:01,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-06 20:56:01,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:56:01,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:01,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash 9066, now seen corresponding path program 1 times [2023-11-06 20:56:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135190391] [2023-11-06 20:56:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:01,327 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-06 20:56:01,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135190391] [2023-11-06 20:56:01,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135190391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:01,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:56:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877593755] [2023-11-06 20:56:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:01,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:56:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:56:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:56:01,336 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:01,521 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2023-11-06 20:56:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:56:01,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-06 20:56:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:01,528 INFO L225 Difference]: With dead ends: 127 [2023-11-06 20:56:01,528 INFO L226 Difference]: Without dead ends: 127 [2023-11-06 20:56:01,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-06 20:56:01,530 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 86 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:01,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 92 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:56:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-06 20:56:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2023-11-06 20:56:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.061224489795918) internal successors, (101), 98 states have internal predecessors, (101), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2023-11-06 20:56:01,552 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 2 [2023-11-06 20:56:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:01,553 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2023-11-06 20:56:01,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2023-11-06 20:56:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:56:01,554 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:01,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:56:01,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:56:01,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:01,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash -211222662, now seen corresponding path program 1 times [2023-11-06 20:56:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333418171] [2023-11-06 20:56:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:01,767 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-06 20:56:01,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333418171] [2023-11-06 20:56:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333418171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:01,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:01,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:56:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747023169] [2023-11-06 20:56:01,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:01,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:56:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:01,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:56:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:56:01,770 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:01,947 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-11-06 20:56:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:56:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:56:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:01,949 INFO L225 Difference]: With dead ends: 105 [2023-11-06 20:56:01,949 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 20:56:01,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:56:01,951 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:01,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:56:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 20:56:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2023-11-06 20:56:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.803921568627451) internal successors, (92), 87 states have internal predecessors, (92), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2023-11-06 20:56:01,961 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 6 [2023-11-06 20:56:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:01,962 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2023-11-06 20:56:01,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2023-11-06 20:56:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:56:01,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:01,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:56:01,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:56:01,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:01,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash -211222661, now seen corresponding path program 1 times [2023-11-06 20:56:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:01,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932720230] [2023-11-06 20:56:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:01,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:02,214 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-06 20:56:02,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:02,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932720230] [2023-11-06 20:56:02,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932720230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:02,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:02,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:56:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27717198] [2023-11-06 20:56:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:02,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:56:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:02,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:56:02,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:56:02,219 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:02,459 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2023-11-06 20:56:02,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:56:02,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:56:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:02,465 INFO L225 Difference]: With dead ends: 159 [2023-11-06 20:56:02,465 INFO L226 Difference]: Without dead ends: 159 [2023-11-06 20:56:02,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:56:02,475 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 159 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:02,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 93 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:56:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-06 20:56:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2023-11-06 20:56:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 114 states have internal predecessors, (126), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2023-11-06 20:56:02,485 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 6 [2023-11-06 20:56:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:02,486 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2023-11-06 20:56:02,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2023-11-06 20:56:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 20:56:02,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:02,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:02,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:56:02,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:02,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1121258366, now seen corresponding path program 1 times [2023-11-06 20:56:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:02,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524613913] [2023-11-06 20:56:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:02,664 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-06 20:56:02,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:02,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524613913] [2023-11-06 20:56:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524613913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:02,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:02,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:56:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141669022] [2023-11-06 20:56:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:56:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:56:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:56:02,667 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:02,846 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2023-11-06 20:56:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:56:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 20:56:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:02,848 INFO L225 Difference]: With dead ends: 115 [2023-11-06 20:56:02,848 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 20:56:02,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:56:02,855 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:02,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 139 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:56:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 20:56:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-06 20:56:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 113 states have internal predecessors, (125), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2023-11-06 20:56:02,877 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 8 [2023-11-06 20:56:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:02,877 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2023-11-06 20:56:02,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2023-11-06 20:56:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 20:56:02,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:02,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:02,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:56:02,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:02,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1121258365, now seen corresponding path program 1 times [2023-11-06 20:56:02,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:02,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266174325] [2023-11-06 20:56:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:03,181 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-06 20:56:03,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266174325] [2023-11-06 20:56:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266174325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:56:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402495664] [2023-11-06 20:56:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:03,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:56:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:56:03,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:56:03,187 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:03,416 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2023-11-06 20:56:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:56:03,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 20:56:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:03,417 INFO L225 Difference]: With dead ends: 112 [2023-11-06 20:56:03,417 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 20:56:03,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:56:03,419 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 11 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:03,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 212 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:56:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 20:56:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2023-11-06 20:56:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 100 states have internal predecessors, (111), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2023-11-06 20:56:03,426 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 8 [2023-11-06 20:56:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:03,426 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2023-11-06 20:56:03,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2023-11-06 20:56:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 20:56:03,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:03,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 20:56:03,436 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:03,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash -401203476, now seen corresponding path program 1 times [2023-11-06 20:56:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639585324] [2023-11-06 20:56:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:03,574 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-06 20:56:03,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:03,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639585324] [2023-11-06 20:56:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639585324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:56:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093018986] [2023-11-06 20:56:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:03,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:56:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:56:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:56:03,577 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:03,734 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2023-11-06 20:56:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:56:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 20:56:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:03,737 INFO L225 Difference]: With dead ends: 101 [2023-11-06 20:56:03,737 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 20:56:03,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:56:03,739 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:03,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:56:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 20:56:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-06 20:56:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 99 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2023-11-06 20:56:03,758 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 9 [2023-11-06 20:56:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:03,759 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2023-11-06 20:56:03,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2023-11-06 20:56:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 20:56:03,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:03,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:03,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 20:56:03,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:03,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash -401203475, now seen corresponding path program 1 times [2023-11-06 20:56:03,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:03,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843097857] [2023-11-06 20:56:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:03,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:03,983 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-06 20:56:03,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843097857] [2023-11-06 20:56:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843097857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:03,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:03,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:56:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881906498] [2023-11-06 20:56:03,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:03,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:56:03,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:03,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:56:03,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:56:03,987 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:04,130 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2023-11-06 20:56:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:56:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 20:56:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:04,132 INFO L225 Difference]: With dead ends: 100 [2023-11-06 20:56:04,132 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 20:56:04,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:56:04,135 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:04,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 221 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:56:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 20:56:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-06 20:56:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 98 states have internal predecessors, (109), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2023-11-06 20:56:04,147 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 9 [2023-11-06 20:56:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:04,147 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2023-11-06 20:56:04,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2023-11-06 20:56:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 20:56:04,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:04,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:04,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 20:56:04,149 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:04,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1916612248, now seen corresponding path program 1 times [2023-11-06 20:56:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95265491] [2023-11-06 20:56:04,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:04,275 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-06 20:56:04,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:04,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95265491] [2023-11-06 20:56:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95265491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:04,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:04,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:56:04,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219098160] [2023-11-06 20:56:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:04,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:56:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:04,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:56:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:56:04,282 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-06 20:56:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:04,406 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2023-11-06 20:56:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:56:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2023-11-06 20:56:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:04,408 INFO L225 Difference]: With dead ends: 107 [2023-11-06 20:56:04,408 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 20:56:04,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:56:04,409 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:04,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 229 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:56:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 20:56:04,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2023-11-06 20:56:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 97 states have internal predecessors, (108), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2023-11-06 20:56:04,414 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 12 [2023-11-06 20:56:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:04,414 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2023-11-06 20:56:04,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-06 20:56:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2023-11-06 20:56:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 20:56:04,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:04,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:04,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 20:56:04,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:04,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1419473554, now seen corresponding path program 1 times [2023-11-06 20:56:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:04,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164446832] [2023-11-06 20:56:04,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:04,491 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-06 20:56:04,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164446832] [2023-11-06 20:56:04,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164446832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:04,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:56:04,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:56:04,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491110499] [2023-11-06 20:56:04,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:04,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:56:04,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:04,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:56:04,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:56:04,494 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:04,598 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2023-11-06 20:56:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:56:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-06 20:56:04,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:04,600 INFO L225 Difference]: With dead ends: 145 [2023-11-06 20:56:04,600 INFO L226 Difference]: Without dead ends: 145 [2023-11-06 20:56:04,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:56:04,601 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 140 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:04,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 122 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:56:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-06 20:56:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2023-11-06 20:56:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 96 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2023-11-06 20:56:04,606 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 13 [2023-11-06 20:56:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:04,606 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2023-11-06 20:56:04,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:56:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2023-11-06 20:56:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 20:56:04,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:04,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:04,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 20:56:04,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-11-06 20:56:04,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 316036739, now seen corresponding path program 1 times [2023-11-06 20:56:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868782507] [2023-11-06 20:56:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:56:04,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 20:56:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:56:04,714 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-06 20:56:04,714 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 20:56:04,715 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (48 of 49 remaining) [2023-11-06 20:56:04,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 49 remaining) [2023-11-06 20:56:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 49 remaining) [2023-11-06 20:56:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 49 remaining) [2023-11-06 20:56:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 49 remaining) [2023-11-06 20:56:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 49 remaining) [2023-11-06 20:56:04,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 49 remaining) [2023-11-06 20:56:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 49 remaining) [2023-11-06 20:56:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 49 remaining) [2023-11-06 20:56:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 49 remaining) [2023-11-06 20:56:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 49 remaining) [2023-11-06 20:56:04,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 49 remaining) [2023-11-06 20:56:04,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 49 remaining) [2023-11-06 20:56:04,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 49 remaining) [2023-11-06 20:56:04,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 49 remaining) [2023-11-06 20:56:04,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 49 remaining) [2023-11-06 20:56:04,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 49 remaining) [2023-11-06 20:56:04,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 49 remaining) [2023-11-06 20:56:04,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 49 remaining) [2023-11-06 20:56:04,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 49 remaining) [2023-11-06 20:56:04,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 49 remaining) [2023-11-06 20:56:04,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 49 remaining) [2023-11-06 20:56:04,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 49 remaining) [2023-11-06 20:56:04,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 49 remaining) [2023-11-06 20:56:04,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 49 remaining) [2023-11-06 20:56:04,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 49 remaining) [2023-11-06 20:56:04,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 49 remaining) [2023-11-06 20:56:04,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 49 remaining) [2023-11-06 20:56:04,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 49 remaining) [2023-11-06 20:56:04,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 49 remaining) [2023-11-06 20:56:04,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 49 remaining) [2023-11-06 20:56:04,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 49 remaining) [2023-11-06 20:56:04,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 49 remaining) [2023-11-06 20:56:04,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 49 remaining) [2023-11-06 20:56:04,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 49 remaining) [2023-11-06 20:56:04,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (13 of 49 remaining) [2023-11-06 20:56:04,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (12 of 49 remaining) [2023-11-06 20:56:04,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (11 of 49 remaining) [2023-11-06 20:56:04,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 49 remaining) [2023-11-06 20:56:04,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 49 remaining) [2023-11-06 20:56:04,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 49 remaining) [2023-11-06 20:56:04,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 49 remaining) [2023-11-06 20:56:04,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (6 of 49 remaining) [2023-11-06 20:56:04,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (5 of 49 remaining) [2023-11-06 20:56:04,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (4 of 49 remaining) [2023-11-06 20:56:04,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (3 of 49 remaining) [2023-11-06 20:56:04,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (2 of 49 remaining) [2023-11-06 20:56:04,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (1 of 49 remaining) [2023-11-06 20:56:04,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK (0 of 49 remaining) [2023-11-06 20:56:04,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 20:56:04,732 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:04,737 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 20:56:04,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:56:04 BoogieIcfgContainer [2023-11-06 20:56:04,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 20:56:04,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 20:56:04,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 20:56:04,761 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 20:56:04,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:56:00" (3/4) ... [2023-11-06 20:56:04,763 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 20:56:04,799 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/witness.graphml.graphml [2023-11-06 20:56:04,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 20:56:04,800 INFO L158 Benchmark]: Toolchain (without parser) took 5719.33ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 93.8MB in the beginning and 103.5MB in the end (delta: -9.7MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2023-11-06 20:56:04,800 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 109.1MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:56:04,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.66ms. Allocated memory is still 132.1MB. Free memory was 93.3MB in the beginning and 76.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 20:56:04,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.51ms. Allocated memory is still 132.1MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:56:04,801 INFO L158 Benchmark]: Boogie Preprocessor took 73.16ms. Allocated memory is still 132.1MB. Free memory was 73.9MB in the beginning and 104.2MB in the end (delta: -30.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 20:56:04,801 INFO L158 Benchmark]: RCFGBuilder took 839.34ms. Allocated memory is still 132.1MB. Free memory was 104.2MB in the beginning and 80.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 20:56:04,802 INFO L158 Benchmark]: TraceAbstraction took 4184.92ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 79.8MB in the beginning and 105.6MB in the end (delta: -25.8MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2023-11-06 20:56:04,802 INFO L158 Benchmark]: Witness Printer took 38.03ms. Allocated memory is still 159.4MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:56:04,804 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 109.1MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.66ms. Allocated memory is still 132.1MB. Free memory was 93.3MB in the beginning and 76.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.51ms. Allocated memory is still 132.1MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.16ms. Allocated memory is still 132.1MB. Free memory was 73.9MB in the beginning and 104.2MB in the end (delta: -30.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 839.34ms. Allocated memory is still 132.1MB. Free memory was 104.2MB in the beginning and 80.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4184.92ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 79.8MB in the beginning and 105.6MB in the end (delta: -25.8MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 38.03ms. Allocated memory is still 159.4MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 992]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) VAL [head={-1:0}] [L1005] head->data = 0 [L1007] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 [L1019] x->next = malloc(sizeof(SLL)) [L1020] EXPR x->next VAL [head={-1:0}, x->next={-2:0}, x={-1:0}] [L1020] x->next->data = 2 [L1022] x = head VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1026] EXPR x->data VAL [head={-1:0}, x->data=1, x={-1:0}] [L1026] COND FALSE !(1 != x->data) [L1031] EXPR x->data VAL [head={-1:0}, x->data=1, x={-1:0}] [L1031] COND TRUE !(2 == x->data) [L1031] CALL reach_error() [L992] COND FALSE !(0) [L992] __assert_fail ("0", "sll-token-1.c", 12, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 49 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 679 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 1479 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 846 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1115 IncrementalHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 633 mSDtfsCounter, 1115 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 170 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 20:56:04,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad3c17c4-1c8c-4639-8df0-b4e11299aff4/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)