./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-2.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_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/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_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/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_d66956e0-74eb-468d-add5-ea321f9c8b14/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 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:55:40,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:55:40,732 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2023-11-06 20:55:40,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:55:40,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:55:40,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:55:40,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:55:40,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:55:40,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:55:40,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:55:40,800 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:55:40,800 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:55:40,801 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:55:40,802 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:55:40,803 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:55:40,803 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:55:40,804 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:55:40,804 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:55:40,804 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:55:40,805 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:55:40,805 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:55:40,806 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:55:40,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:55:40,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:55:40,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:55:40,808 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:55:40,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:55:40,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:55:40,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:55:40,819 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:55:40,820 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:55:40,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:55:40,821 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:55:40,821 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:55:40,821 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:55:40,822 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:55:40,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:55:40,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:55:40,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:55:40,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:55:40,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:55:40,824 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:55:40,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:55:40,824 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:55:40,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:55:40,825 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_d66956e0-74eb-468d-add5-ea321f9c8b14/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_d66956e0-74eb-468d-add5-ea321f9c8b14/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 -> 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 [2023-11-06 20:55:41,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:55:41,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:55:41,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:55:41,155 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:55:41,156 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:55:41,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/forester-heap/dll-token-2.i [2023-11-06 20:55:44,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:55:44,588 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:55:44,588 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/sv-benchmarks/c/forester-heap/dll-token-2.i [2023-11-06 20:55:44,617 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/data/120299c99/8b4a23c5209446999286e48b5c4a6aad/FLAGd320f2d2a [2023-11-06 20:55:44,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/data/120299c99/8b4a23c5209446999286e48b5c4a6aad [2023-11-06 20:55:44,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:55:44,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:55:44,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:55:44,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:55:44,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:55:44,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:55:44" (1/1) ... [2023-11-06 20:55:44,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ceea10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:44, skipping insertion in model container [2023-11-06 20:55:44,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:55:44" (1/1) ... [2023-11-06 20:55:44,713 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:55:45,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:55:45,074 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:55:45,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:55:45,162 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:55:45,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:45 WrapperNode [2023-11-06 20:55:45,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:55:45,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:55:45,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:55:45,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:55:45,172 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:45" (1/1) ... [2023-11-06 20:55:45,186 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:45" (1/1) ... [2023-11-06 20:55:45,218 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-11-06 20:55:45,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:55:45,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:55:45,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:55:45,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:55:45,228 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:45" (1/1) ... [2023-11-06 20:55:45,229 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:45" (1/1) ... [2023-11-06 20:55:45,233 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:45" (1/1) ... [2023-11-06 20:55:45,234 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:45" (1/1) ... [2023-11-06 20:55:45,245 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:45" (1/1) ... [2023-11-06 20:55:45,250 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:45" (1/1) ... [2023-11-06 20:55:45,253 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:45" (1/1) ... [2023-11-06 20:55:45,255 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:45" (1/1) ... [2023-11-06 20:55:45,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:55:45,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:55:45,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:55:45,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:55:45,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:45" (1/1) ... [2023-11-06 20:55:45,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:55:45,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:55:45,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/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:45,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/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:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-06 20:55:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-06 20:55:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:55:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:55:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:55:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:55:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:55:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:55:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:55:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:55:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:55:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:55:45,488 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:55:45,490 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:55:45,936 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:55:46,013 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:55:46,015 INFO L302 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-06 20:55:46,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:55:46 BoogieIcfgContainer [2023-11-06 20:55:46,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:55:46,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:55:46,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:55:46,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:55:46,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:55:44" (1/3) ... [2023-11-06 20:55:46,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1483468d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:55:46, skipping insertion in model container [2023-11-06 20:55:46,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:45" (2/3) ... [2023-11-06 20:55:46,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1483468d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:55:46, skipping insertion in model container [2023-11-06 20:55:46,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:55:46" (3/3) ... [2023-11-06 20:55:46,028 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2023-11-06 20:55:46,045 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:55:46,045 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-06 20:55:46,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:55:46,105 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;@79776af7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:55:46,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-06 20:55:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 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:55:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-06 20:55:46,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:46,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-06 20:55:46,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:46,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:46,122 INFO L85 PathProgramCache]: Analyzing trace with hash 9499, now seen corresponding path program 1 times [2023-11-06 20:55:46,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:46,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176933598] [2023-11-06 20:55:46,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:46,359 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:55:46,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:46,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176933598] [2023-11-06 20:55:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176933598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:46,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:46,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:55:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299150818] [2023-11-06 20:55:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:46,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:55:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:55:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:55:46,408 INFO L87 Difference]: Start difference. First operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 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:55:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:46,657 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-11-06 20:55:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:55:46,660 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:55:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:46,673 INFO L225 Difference]: With dead ends: 136 [2023-11-06 20:55:46,673 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 20:55:46,675 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:55:46,682 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:46,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 20:55:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2023-11-06 20:55:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 114 states have internal predecessors, (117), 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:55:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2023-11-06 20:55:46,752 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2023-11-06 20:55:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:46,753 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2023-11-06 20:55:46,753 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:55:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2023-11-06 20:55:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-06 20:55:46,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:46,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-06 20:55:46,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:55:46,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:46,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash 9500, now seen corresponding path program 1 times [2023-11-06 20:55:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:46,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638908282] [2023-11-06 20:55:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:46,894 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:55:46,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638908282] [2023-11-06 20:55:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638908282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:46,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:46,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:55:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339148922] [2023-11-06 20:55:46,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:46,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:55:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:55:46,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:55:46,899 INFO L87 Difference]: Start difference. First operand 116 states and 123 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:55:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:47,062 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2023-11-06 20:55:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:55:47,062 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:55:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:47,068 INFO L225 Difference]: With dead ends: 140 [2023-11-06 20:55:47,068 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 20:55:47,073 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:55:47,077 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:47,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 96 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:55:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 20:55:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2023-11-06 20:55:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 54 states have (on average 2.111111111111111) internal successors, (114), 111 states have internal predecessors, (114), 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:55:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2023-11-06 20:55:47,095 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 2 [2023-11-06 20:55:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:47,095 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2023-11-06 20:55:47,095 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:55:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2023-11-06 20:55:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 20:55:47,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:47,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:47,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:55:47,098 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:47,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1358927011, now seen corresponding path program 1 times [2023-11-06 20:55:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711924769] [2023-11-06 20:55:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:47,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:47,258 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:55:47,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:47,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711924769] [2023-11-06 20:55:47,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711924769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:47,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:47,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:55:47,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004600177] [2023-11-06 20:55:47,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:47,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:55:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:47,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:55:47,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:55:47,261 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:47,461 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-06 20:55:47,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:55:47,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-06 20:55:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:47,467 INFO L225 Difference]: With dead ends: 116 [2023-11-06 20:55:47,468 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 20:55:47,468 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:55:47,474 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:47,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 67 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 20:55:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2023-11-06 20:55:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 98 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:55:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-06 20:55:47,494 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 7 [2023-11-06 20:55:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:47,494 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-06 20:55:47,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-06 20:55:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 20:55:47,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:47,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:47,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:55:47,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:47,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:47,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1358927012, now seen corresponding path program 1 times [2023-11-06 20:55:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:47,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644208174] [2023-11-06 20:55:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:47,706 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:55:47,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644208174] [2023-11-06 20:55:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644208174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:55:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616418156] [2023-11-06 20:55:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:47,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:55:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:55:47,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:55:47,709 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:48,007 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2023-11-06 20:55:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:55:48,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-06 20:55:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:48,009 INFO L225 Difference]: With dead ends: 178 [2023-11-06 20:55:48,010 INFO L226 Difference]: Without dead ends: 178 [2023-11-06 20:55:48,010 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:55:48,011 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 185 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:48,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 97 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 20:55:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-06 20:55:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 131. [2023-11-06 20:55:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.6666666666666667) internal successors, (145), 129 states have internal predecessors, (145), 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:55:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2023-11-06 20:55:48,022 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 7 [2023-11-06 20:55:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:48,023 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2023-11-06 20:55:48,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2023-11-06 20:55:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 20:55:48,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:48,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:48,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:55:48,025 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:48,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 259058291, now seen corresponding path program 1 times [2023-11-06 20:55:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:48,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156599171] [2023-11-06 20:55:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:48,231 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:55:48,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156599171] [2023-11-06 20:55:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156599171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:48,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:55:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595549041] [2023-11-06 20:55:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:48,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:55:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:55:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:55:48,238 INFO L87 Difference]: Start difference. First operand 131 states and 151 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:55:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:48,415 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2023-11-06 20:55:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:55:48,416 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:55:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:48,417 INFO L225 Difference]: With dead ends: 130 [2023-11-06 20:55:48,417 INFO L226 Difference]: Without dead ends: 130 [2023-11-06 20:55:48,418 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:55:48,419 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:48,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-06 20:55:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-06 20:55:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 128 states have internal predecessors, (143), 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:55:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2023-11-06 20:55:48,441 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 9 [2023-11-06 20:55:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:48,442 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2023-11-06 20:55:48,442 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:55:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2023-11-06 20:55:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 20:55:48,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:48,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:48,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:55:48,443 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:48,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash 259058292, now seen corresponding path program 1 times [2023-11-06 20:55:48,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:48,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602151998] [2023-11-06 20:55:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:48,727 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:55:48,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602151998] [2023-11-06 20:55:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602151998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:48,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:48,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:55:48,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688256903] [2023-11-06 20:55:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:48,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:55:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:55:48,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:55:48,742 INFO L87 Difference]: Start difference. First operand 130 states and 149 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:55:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:48,940 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2023-11-06 20:55:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:55:48,940 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:55:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:48,942 INFO L225 Difference]: With dead ends: 129 [2023-11-06 20:55:48,942 INFO L226 Difference]: Without dead ends: 129 [2023-11-06 20:55:48,942 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:55:48,943 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:48,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-06 20:55:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-06 20:55:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 127 states have internal predecessors, (141), 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:55:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2023-11-06 20:55:48,949 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 9 [2023-11-06 20:55:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:48,950 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2023-11-06 20:55:48,956 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:55:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2023-11-06 20:55:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:55:48,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:48,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:48,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 20:55:48,958 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:48,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash -560891636, now seen corresponding path program 1 times [2023-11-06 20:55:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:48,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869545687] [2023-11-06 20:55:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:49,090 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:55:49,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869545687] [2023-11-06 20:55:49,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869545687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:49,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:49,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:55:49,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533762371] [2023-11-06 20:55:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:49,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:55:49,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:49,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:55:49,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:55:49,093 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:55:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:49,261 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2023-11-06 20:55:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:55:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-06 20:55:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:49,263 INFO L225 Difference]: With dead ends: 128 [2023-11-06 20:55:49,263 INFO L226 Difference]: Without dead ends: 128 [2023-11-06 20:55:49,264 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:55:49,264 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:49,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:55:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-06 20:55:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-06 20:55:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.5977011494252873) internal successors, (139), 126 states have internal predecessors, (139), 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:55:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2023-11-06 20:55:49,270 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 10 [2023-11-06 20:55:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:49,270 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2023-11-06 20:55:49,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:55:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2023-11-06 20:55:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:55:49,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:49,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:49,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 20:55:49,272 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:49,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash -560891635, now seen corresponding path program 1 times [2023-11-06 20:55:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106129512] [2023-11-06 20:55:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:49,468 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:55:49,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:49,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106129512] [2023-11-06 20:55:49,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106129512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:49,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:49,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:55:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606165235] [2023-11-06 20:55:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:49,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:55:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:55:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:55:49,472 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:55:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:49,637 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2023-11-06 20:55:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:55:49,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-06 20:55:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:49,639 INFO L225 Difference]: With dead ends: 127 [2023-11-06 20:55:49,639 INFO L226 Difference]: Without dead ends: 127 [2023-11-06 20:55:49,639 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:55:49,643 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:49,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:55:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-06 20:55:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-06 20:55:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 125 states have internal predecessors, (137), 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:55:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2023-11-06 20:55:49,649 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 10 [2023-11-06 20:55:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:49,650 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2023-11-06 20:55:49,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:55:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2023-11-06 20:55:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 20:55:49,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:49,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 20:55:49,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:49,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash -152845188, now seen corresponding path program 1 times [2023-11-06 20:55:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:49,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947261538] [2023-11-06 20:55:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:49,964 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:55:49,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947261538] [2023-11-06 20:55:49,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947261538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:49,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:49,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 20:55:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668815240] [2023-11-06 20:55:49,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:49,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 20:55:49,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:49,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 20:55:49,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:55:49,968 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:55:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:50,288 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2023-11-06 20:55:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:55:50,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-06 20:55:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:50,290 INFO L225 Difference]: With dead ends: 130 [2023-11-06 20:55:50,290 INFO L226 Difference]: Without dead ends: 130 [2023-11-06 20:55:50,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-06 20:55:50,291 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 151 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:50,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 152 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-06 20:55:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2023-11-06 20:55:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 124 states have internal predecessors, (136), 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:55:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2023-11-06 20:55:50,296 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 11 [2023-11-06 20:55:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:50,297 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2023-11-06 20:55:50,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:55:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2023-11-06 20:55:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 20:55:50,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:50,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:50,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 20:55:50,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:50,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash -152845187, now seen corresponding path program 1 times [2023-11-06 20:55:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:50,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142251233] [2023-11-06 20:55:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:50,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:50,616 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:55:50,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142251233] [2023-11-06 20:55:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142251233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:50,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 20:55:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597544207] [2023-11-06 20:55:50,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:50,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 20:55:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:50,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 20:55:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:55:50,618 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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:55:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:51,140 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2023-11-06 20:55:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 20:55:51,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-06 20:55:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:51,142 INFO L225 Difference]: With dead ends: 125 [2023-11-06 20:55:51,142 INFO L226 Difference]: Without dead ends: 125 [2023-11-06 20:55:51,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-06 20:55:51,143 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 144 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:51,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 207 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 20:55:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-06 20:55:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-11-06 20:55:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 105 states have internal predecessors, (116), 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:55:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2023-11-06 20:55:51,147 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 11 [2023-11-06 20:55:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:51,148 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2023-11-06 20:55:51,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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:55:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2023-11-06 20:55:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 20:55:51,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:51,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:51,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 20:55:51,158 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:51,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2145763889, now seen corresponding path program 1 times [2023-11-06 20:55:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024571482] [2023-11-06 20:55:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:51,349 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:55:51,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:51,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024571482] [2023-11-06 20:55:51,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024571482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:51,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:51,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:55:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097672215] [2023-11-06 20:55:51,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:51,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:55:51,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:55:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:55:51,352 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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:55:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:51,513 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2023-11-06 20:55:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:55:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-06 20:55:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:51,515 INFO L225 Difference]: With dead ends: 106 [2023-11-06 20:55:51,515 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 20:55:51,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:55:51,516 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:51,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:55:51,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 20:55:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-06 20:55:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.513157894736842) internal successors, (115), 104 states have internal predecessors, (115), 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:55:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-11-06 20:55:51,521 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 12 [2023-11-06 20:55:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:51,521 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-11-06 20:55:51,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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:55:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-11-06 20:55:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 20:55:51,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:51,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:51,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 20:55:51,523 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:51,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2145763888, now seen corresponding path program 1 times [2023-11-06 20:55:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:51,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470007266] [2023-11-06 20:55:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:51,799 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:55:51,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:51,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470007266] [2023-11-06 20:55:51,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470007266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:51,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:51,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:55:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709914201] [2023-11-06 20:55:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:51,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:55:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:55:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:55:51,802 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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:55:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:52,013 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2023-11-06 20:55:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:55:52,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-06 20:55:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:52,014 INFO L225 Difference]: With dead ends: 105 [2023-11-06 20:55:52,014 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 20:55:52,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:55:52,015 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:52,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 249 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 20:55:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-06 20:55:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.5) internal successors, (114), 103 states have internal predecessors, (114), 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:55:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2023-11-06 20:55:52,020 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 12 [2023-11-06 20:55:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:52,020 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2023-11-06 20:55:52,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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:55:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2023-11-06 20:55:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 20:55:52,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:52,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:52,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 20:55:52,021 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:52,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1639718935, now seen corresponding path program 1 times [2023-11-06 20:55:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333102554] [2023-11-06 20:55:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:52,212 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:55:52,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:52,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333102554] [2023-11-06 20:55:52,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333102554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:52,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 20:55:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589357441] [2023-11-06 20:55:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 20:55:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 20:55:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:55:52,214 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:55:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:52,627 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-11-06 20:55:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 20:55:52,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 15 [2023-11-06 20:55:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:52,629 INFO L225 Difference]: With dead ends: 120 [2023-11-06 20:55:52,629 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 20:55:52,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-06 20:55:52,630 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 136 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:52,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 242 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 20:55:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 20:55:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2023-11-06 20:55:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.486842105263158) internal successors, (113), 102 states have internal predecessors, (113), 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:55:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-06 20:55:52,634 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 15 [2023-11-06 20:55:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:52,634 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-06 20:55:52,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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:55:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-06 20:55:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 20:55:52,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:52,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:52,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 20:55:52,636 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:52,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1424546549, now seen corresponding path program 1 times [2023-11-06 20:55:52,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:52,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85843250] [2023-11-06 20:55:52,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:52,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:52,695 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:55:52,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:52,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85843250] [2023-11-06 20:55:52,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85843250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:52,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:52,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:55:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331005273] [2023-11-06 20:55:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:55:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:55:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:55:52,698 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:55:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:52,818 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2023-11-06 20:55:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:55:52,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2023-11-06 20:55:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:52,821 INFO L225 Difference]: With dead ends: 154 [2023-11-06 20:55:52,821 INFO L226 Difference]: Without dead ends: 154 [2023-11-06 20:55:52,829 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:55:52,830 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 148 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:52,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:55:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-06 20:55:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2023-11-06 20:55:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 101 states have internal predecessors, (112), 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:55:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2023-11-06 20:55:52,834 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 16 [2023-11-06 20:55:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:52,834 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2023-11-06 20:55:52,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:55:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2023-11-06 20:55:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 20:55:52,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:52,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:52,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 20:55:52,838 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:52,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1466154771, now seen corresponding path program 1 times [2023-11-06 20:55:52,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:52,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464904928] [2023-11-06 20:55:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:52,909 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:55:52,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:52,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464904928] [2023-11-06 20:55:52,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464904928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:52,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:52,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:55:52,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504471199] [2023-11-06 20:55:52,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:52,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:55:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:52,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:55:52,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:55:52,912 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:55:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:53,042 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-11-06 20:55:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:55:53,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 21 [2023-11-06 20:55:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:53,044 INFO L225 Difference]: With dead ends: 102 [2023-11-06 20:55:53,044 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 20:55:53,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:55:53,045 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:53,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 195 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:55:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 20:55:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-06 20:55:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 100 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-11-06 20:55:53,049 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 21 [2023-11-06 20:55:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:53,050 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-11-06 20:55:53,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:55:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-11-06 20:55:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 20:55:53,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:53,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:53,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 20:55:53,052 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:53,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1434637815, now seen corresponding path program 1 times [2023-11-06 20:55:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348494733] [2023-11-06 20:55:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:53,826 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:55:53,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:53,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348494733] [2023-11-06 20:55:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348494733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 20:55:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534025518] [2023-11-06 20:55:53,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:53,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 20:55:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 20:55:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-06 20:55:53,831 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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:55:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:54,321 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2023-11-06 20:55:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 20:55:54,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 21 [2023-11-06 20:55:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:54,322 INFO L225 Difference]: With dead ends: 133 [2023-11-06 20:55:54,322 INFO L226 Difference]: Without dead ends: 133 [2023-11-06 20:55:54,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-11-06 20:55:54,323 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 130 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:54,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 305 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 20:55:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-06 20:55:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2023-11-06 20:55:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 112 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2023-11-06 20:55:54,327 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 21 [2023-11-06 20:55:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:54,328 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2023-11-06 20:55:54,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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:55:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2023-11-06 20:55:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 20:55:54,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:54,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:54,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 20:55:54,329 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:54,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1466124187, now seen corresponding path program 1 times [2023-11-06 20:55:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:54,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979672900] [2023-11-06 20:55:54,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:54,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:54,782 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:55:54,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:54,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979672900] [2023-11-06 20:55:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979672900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:54,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:54,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 20:55:54,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245645348] [2023-11-06 20:55:54,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:54,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 20:55:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:54,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 20:55:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:55:54,784 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:55,136 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2023-11-06 20:55:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 20:55:55,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-06 20:55:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:55,138 INFO L225 Difference]: With dead ends: 135 [2023-11-06 20:55:55,138 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 20:55:55,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-06 20:55:55,139 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 134 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:55,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 161 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 20:55:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2023-11-06 20:55:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 117 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-11-06 20:55:55,143 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 21 [2023-11-06 20:55:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:55,143 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-11-06 20:55:55,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-11-06 20:55:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 20:55:55,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:55,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:55,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 20:55:55,144 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:55,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1466124186, now seen corresponding path program 1 times [2023-11-06 20:55:55,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:55,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700639806] [2023-11-06 20:55:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:55,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:55,633 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:55:55,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700639806] [2023-11-06 20:55:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700639806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:55,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:55,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 20:55:55,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971709837] [2023-11-06 20:55:55,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:55,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 20:55:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:55,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 20:55:55,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:55:55,635 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:55,936 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2023-11-06 20:55:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:55:55,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-06 20:55:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:55,938 INFO L225 Difference]: With dead ends: 138 [2023-11-06 20:55:55,938 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 20:55:55,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 20:55:55,939 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 48 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:55,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 240 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 20:55:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 20:55:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2023-11-06 20:55:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-06 20:55:55,943 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 21 [2023-11-06 20:55:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:55,944 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-06 20:55:55,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-06 20:55:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 20:55:55,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:55,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:55,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 20:55:55,945 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 20:55:55,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash 559452283, now seen corresponding path program 1 times [2023-11-06 20:55:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:55,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119897950] [2023-11-06 20:55:55,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:55:55,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 20:55:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:55:56,035 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-06 20:55:56,037 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 20:55:56,039 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2023-11-06 20:55:56,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-11-06 20:55:56,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-11-06 20:55:56,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-11-06 20:55:56,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-11-06 20:55:56,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-11-06 20:55:56,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-11-06 20:55:56,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-11-06 20:55:56,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-11-06 20:55:56,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-11-06 20:55:56,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-11-06 20:55:56,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-11-06 20:55:56,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-11-06 20:55:56,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-11-06 20:55:56,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-11-06 20:55:56,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-11-06 20:55:56,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-11-06 20:55:56,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 59 remaining) [2023-11-06 20:55:56,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-11-06 20:55:56,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-11-06 20:55:56,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-11-06 20:55:56,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-11-06 20:55:56,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-11-06 20:55:56,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-11-06 20:55:56,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2023-11-06 20:55:56,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-11-06 20:55:56,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2023-11-06 20:55:56,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-11-06 20:55:56,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-11-06 20:55:56,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-11-06 20:55:56,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-11-06 20:55:56,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-11-06 20:55:56,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-11-06 20:55:56,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-11-06 20:55:56,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 59 remaining) [2023-11-06 20:55:56,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 59 remaining) [2023-11-06 20:55:56,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 59 remaining) [2023-11-06 20:55:56,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 59 remaining) [2023-11-06 20:55:56,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-11-06 20:55:56,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-11-06 20:55:56,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-11-06 20:55:56,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-11-06 20:55:56,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-11-06 20:55:56,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-11-06 20:55:56,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2023-11-06 20:55:56,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (13 of 59 remaining) [2023-11-06 20:55:56,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (12 of 59 remaining) [2023-11-06 20:55:56,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (11 of 59 remaining) [2023-11-06 20:55:56,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-11-06 20:55:56,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-11-06 20:55:56,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-11-06 20:55:56,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-11-06 20:55:56,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (6 of 59 remaining) [2023-11-06 20:55:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (5 of 59 remaining) [2023-11-06 20:55:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (4 of 59 remaining) [2023-11-06 20:55:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (3 of 59 remaining) [2023-11-06 20:55:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (2 of 59 remaining) [2023-11-06 20:55:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (1 of 59 remaining) [2023-11-06 20:55:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK (0 of 59 remaining) [2023-11-06 20:55:56,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 20:55:56,074 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:56,078 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 20:55:56,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:55:56 BoogieIcfgContainer [2023-11-06 20:55:56,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 20:55:56,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 20:55:56,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 20:55:56,111 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 20:55:56,111 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:55:46" (3/4) ... [2023-11-06 20:55:56,112 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 20:55:56,170 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/bin/utaipan-verify-FOvIYxoinp/witness.graphml.graphml [2023-11-06 20:55:56,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 20:55:56,172 INFO L158 Benchmark]: Toolchain (without parser) took 11535.09ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 113.5MB in the beginning and 190.1MB in the end (delta: -76.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:55:56,172 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 157.3MB. Free memory was 125.0MB in the beginning and 124.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:55:56,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.87ms. Allocated memory is still 157.3MB. Free memory was 113.5MB in the beginning and 95.6MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 20:55:56,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.85ms. Allocated memory is still 157.3MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:55:56,173 INFO L158 Benchmark]: Boogie Preprocessor took 39.04ms. Allocated memory is still 157.3MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:55:56,174 INFO L158 Benchmark]: RCFGBuilder took 760.21ms. Allocated memory is still 157.3MB. Free memory was 91.5MB in the beginning and 65.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 20:55:56,174 INFO L158 Benchmark]: TraceAbstraction took 10087.72ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 64.8MB in the beginning and 192.2MB in the end (delta: -127.4MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2023-11-06 20:55:56,174 INFO L158 Benchmark]: Witness Printer took 59.68ms. Allocated memory is still 226.5MB. Free memory was 192.2MB in the beginning and 190.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:55:56,180 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.36ms. Allocated memory is still 157.3MB. Free memory was 125.0MB in the beginning and 124.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.87ms. Allocated memory is still 157.3MB. Free memory was 113.5MB in the beginning and 95.6MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.85ms. Allocated memory is still 157.3MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.04ms. Allocated memory is still 157.3MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 760.21ms. Allocated memory is still 157.3MB. Free memory was 91.5MB in the beginning and 65.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10087.72ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 64.8MB in the beginning and 192.2MB in the end (delta: -127.4MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * Witness Printer took 59.68ms. Allocated memory is still 226.5MB. Free memory was 192.2MB in the beginning and 190.1MB 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: [L1004] SLL* head = malloc(sizeof(SLL)); [L1005] head->next = ((void*)0) VAL [head={-1:0}] [L1006] head->prev = ((void*)0) VAL [head={-1:0}] [L1007] head->data = 0 [L1009] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = 1 [L1022] x->next = malloc(sizeof(SLL)) [L1023] EXPR x->next VAL [head={-1:0}, x->next={-2:0}, x={-1:0}] [L1023] x->next->prev = x [L1024] EXPR x->next VAL [head={-1:0}, x->next={-2:0}, x={-1:0}] [L1024] x->next->data = 2 [L1026] x = head VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, x->data=1, x={-1:0}] [L1030] COND FALSE !(1 != x->data) [L1035] EXPR x->data VAL [head={-1:0}, x->data=1, x={-1:0}] [L1035] COND FALSE !(!(1 == x->data)) [L1036] EXPR x->next [L1036] x = x->next [L1037] EXPR x->data VAL [head={-1:0}, x->data=2, x={-2:0}] [L1037] COND TRUE !(2 != x->data) [L1037] CALL reach_error() [L992] COND FALSE !(0) [L992] __assert_fail ("0", "dll-token-2.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: -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: 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: -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: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: 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, 128 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1463 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1463 mSDsluCounter, 3400 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2262 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3658 IncrementalHoareTripleChecker+Invalid, 3826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 1138 mSDtfsCounter, 3658 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=4, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 252 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:55:56,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d66956e0-74eb-468d-add5-ea321f9c8b14/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)