./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a 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_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:56,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:57,070 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:02:57,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:57,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:57,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:57,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:57,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:57,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:57,111 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:57,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:57,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:57,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:57,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:57,113 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:57,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:57,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:57,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:57,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:57,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:57,115 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:02:57,120 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:02:57,120 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:02:57,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:57,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:02:57,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:57,124 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:02:57,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:57,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:57,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:57,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:57,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:57,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:57,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:57,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:57,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:57,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:02:57,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:02:57,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:57,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:57,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:57,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:57,136 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/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_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2024-10-31 22:02:57,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:57,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:57,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:57,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:57,490 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:57,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/locks/test_locks_11.c Unable to find full path for "g++" [2024-10-31 22:02:59,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:03:00,039 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:03:00,040 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/sv-benchmarks/c/locks/test_locks_11.c [2024-10-31 22:03:00,051 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/data/b7b1f9a44/464957d3c7864532bdba0a43d8e6ec97/FLAG232b7fb64 [2024-10-31 22:03:00,066 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/data/b7b1f9a44/464957d3c7864532bdba0a43d8e6ec97 [2024-10-31 22:03:00,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:03:00,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:03:00,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:00,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:03:00,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:03:00,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cc212d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00, skipping insertion in model container [2024-10-31 22:03:00,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:03:00,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:03:00,334 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:03:00,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:03:00,394 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:03:00,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00 WrapperNode [2024-10-31 22:03:00,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:00,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:03:00,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:03:00,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:03:00,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,450 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2024-10-31 22:03:00,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:03:00,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:03:00,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:03:00,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:03:00,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:03:00,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:03:00,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:03:00,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:03:00,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:03:00,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (1/1) ... [2024-10-31 22:03:00,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:03:00,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:03:00,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:03:00,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:03:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:03:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:03:00,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:03:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:03:00,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:03:00,701 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:03:01,052 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-31 22:03:01,052 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:03:01,066 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:03:01,067 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:03:01,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:01 BoogieIcfgContainer [2024-10-31 22:03:01,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:03:01,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:03:01,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:03:01,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:03:01,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:03:00" (1/3) ... [2024-10-31 22:03:01,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76744e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:03:01, skipping insertion in model container [2024-10-31 22:03:01,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:00" (2/3) ... [2024-10-31 22:03:01,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76744e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:03:01, skipping insertion in model container [2024-10-31 22:03:01,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:01" (3/3) ... [2024-10-31 22:03:01,083 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2024-10-31 22:03:01,102 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:03:01,103 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:03:01,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:03:01,153 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@712a009b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:03:01,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-31 22:03:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:03:01,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:01,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:03:01,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 28704014, now seen corresponding path program 1 times [2024-10-31 22:03:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589903118] [2024-10-31 22:03:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:01,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:01,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589903118] [2024-10-31 22:03:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589903118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:01,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:01,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:03:01,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287498501] [2024-10-31 22:03:01,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:01,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:03:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:01,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:03:01,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:03:01,452 INFO L87 Difference]: Start difference. First operand has 46 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:01,469 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2024-10-31 22:03:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:03:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-31 22:03:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:01,479 INFO L225 Difference]: With dead ends: 45 [2024-10-31 22:03:01,479 INFO L226 Difference]: Without dead ends: 43 [2024-10-31 22:03:01,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:03:01,485 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:01,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-31 22:03:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-31 22:03:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.829268292682927) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2024-10-31 22:03:01,536 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 5 [2024-10-31 22:03:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:01,537 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 75 transitions. [2024-10-31 22:03:01,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 75 transitions. [2024-10-31 22:03:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-31 22:03:01,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:01,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:03:01,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:03:01,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:01,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 889698510, now seen corresponding path program 1 times [2024-10-31 22:03:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:01,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790654506] [2024-10-31 22:03:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790654506] [2024-10-31 22:03:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790654506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:03:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516123771] [2024-10-31 22:03:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:01,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:01,617 INFO L87 Difference]: Start difference. First operand 43 states and 75 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:01,628 INFO L93 Difference]: Finished difference Result 42 states and 74 transitions. [2024-10-31 22:03:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:01,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-31 22:03:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:01,630 INFO L225 Difference]: With dead ends: 42 [2024-10-31 22:03:01,630 INFO L226 Difference]: Without dead ends: 40 [2024-10-31 22:03:01,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:01,632 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:01,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-31 22:03:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-31 22:03:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2024-10-31 22:03:01,639 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 72 transitions. Word has length 6 [2024-10-31 22:03:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:01,640 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 72 transitions. [2024-10-31 22:03:01,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 72 transitions. [2024-10-31 22:03:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:03:01,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:01,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:01,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:03:01,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:01,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1341606449, now seen corresponding path program 1 times [2024-10-31 22:03:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:01,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710060631] [2024-10-31 22:03:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710060631] [2024-10-31 22:03:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710060631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579129258] [2024-10-31 22:03:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:01,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:01,792 INFO L87 Difference]: Start difference. First operand 40 states and 72 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:01,836 INFO L93 Difference]: Finished difference Result 77 states and 139 transitions. [2024-10-31 22:03:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:03:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:01,838 INFO L225 Difference]: With dead ends: 77 [2024-10-31 22:03:01,838 INFO L226 Difference]: Without dead ends: 77 [2024-10-31 22:03:01,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:01,840 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:01,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-31 22:03:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2024-10-31 22:03:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 95 transitions. [2024-10-31 22:03:01,857 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 95 transitions. Word has length 19 [2024-10-31 22:03:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:01,858 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 95 transitions. [2024-10-31 22:03:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 95 transitions. [2024-10-31 22:03:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:03:01,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:01,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:01,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:03:01,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:01,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash 61742771, now seen corresponding path program 1 times [2024-10-31 22:03:01,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064370780] [2024-10-31 22:03:01,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:01,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064370780] [2024-10-31 22:03:01,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064370780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:01,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:01,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:01,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335897240] [2024-10-31 22:03:01,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:01,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:01,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:01,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:01,952 INFO L87 Difference]: Start difference. First operand 52 states and 95 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:01,974 INFO L93 Difference]: Finished difference Result 77 states and 137 transitions. [2024-10-31 22:03:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:03:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:01,976 INFO L225 Difference]: With dead ends: 77 [2024-10-31 22:03:01,976 INFO L226 Difference]: Without dead ends: 77 [2024-10-31 22:03:01,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:01,978 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:01,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-31 22:03:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-31 22:03:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 135 transitions. [2024-10-31 22:03:01,995 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 135 transitions. Word has length 19 [2024-10-31 22:03:01,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:01,996 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 135 transitions. [2024-10-31 22:03:01,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2024-10-31 22:03:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:03:01,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:01,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:01,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:03:01,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:01,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1353275597, now seen corresponding path program 1 times [2024-10-31 22:03:02,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:02,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332128605] [2024-10-31 22:03:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:02,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332128605] [2024-10-31 22:03:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332128605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591258360] [2024-10-31 22:03:02,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:02,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:02,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,113 INFO L87 Difference]: Start difference. First operand 74 states and 135 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:02,157 INFO L93 Difference]: Finished difference Result 80 states and 139 transitions. [2024-10-31 22:03:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:02,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-31 22:03:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:02,159 INFO L225 Difference]: With dead ends: 80 [2024-10-31 22:03:02,163 INFO L226 Difference]: Without dead ends: 80 [2024-10-31 22:03:02,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,165 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:02,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-31 22:03:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-10-31 22:03:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 137 transitions. [2024-10-31 22:03:02,185 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 137 transitions. Word has length 20 [2024-10-31 22:03:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:02,185 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 137 transitions. [2024-10-31 22:03:02,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 137 transitions. [2024-10-31 22:03:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:03:02,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:02,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:02,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:03:02,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:02,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1920623345, now seen corresponding path program 1 times [2024-10-31 22:03:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:02,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935047139] [2024-10-31 22:03:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935047139] [2024-10-31 22:03:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935047139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038281123] [2024-10-31 22:03:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:02,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,312 INFO L87 Difference]: Start difference. First operand 77 states and 137 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:02,355 INFO L93 Difference]: Finished difference Result 145 states and 260 transitions. [2024-10-31 22:03:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:02,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-31 22:03:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:02,361 INFO L225 Difference]: With dead ends: 145 [2024-10-31 22:03:02,361 INFO L226 Difference]: Without dead ends: 145 [2024-10-31 22:03:02,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,363 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:02,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-31 22:03:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 102. [2024-10-31 22:03:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 182 transitions. [2024-10-31 22:03:02,383 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 182 transitions. Word has length 20 [2024-10-31 22:03:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:02,384 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 182 transitions. [2024-10-31 22:03:02,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 182 transitions. [2024-10-31 22:03:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:03:02,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:02,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:02,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:03:02,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 640759667, now seen corresponding path program 1 times [2024-10-31 22:03:02,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:02,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115406670] [2024-10-31 22:03:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:02,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:02,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115406670] [2024-10-31 22:03:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115406670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:02,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:02,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:02,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357038801] [2024-10-31 22:03:02,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:02,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:02,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:02,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:02,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,500 INFO L87 Difference]: Start difference. First operand 102 states and 182 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:02,533 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2024-10-31 22:03:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:02,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-31 22:03:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:02,536 INFO L225 Difference]: With dead ends: 147 [2024-10-31 22:03:02,536 INFO L226 Difference]: Without dead ends: 147 [2024-10-31 22:03:02,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,537 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:02,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-31 22:03:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-10-31 22:03:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 256 transitions. [2024-10-31 22:03:02,556 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 256 transitions. Word has length 20 [2024-10-31 22:03:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:02,556 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 256 transitions. [2024-10-31 22:03:02,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 256 transitions. [2024-10-31 22:03:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:03:02,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:02,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:02,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:03:02,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:02,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash -583610434, now seen corresponding path program 1 times [2024-10-31 22:03:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241281184] [2024-10-31 22:03:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:02,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:02,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:02,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241281184] [2024-10-31 22:03:02,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241281184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:02,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:02,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353656349] [2024-10-31 22:03:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:02,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:02,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:02,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,619 INFO L87 Difference]: Start difference. First operand 144 states and 256 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2024-10-31 22:03:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:02,638 INFO L93 Difference]: Finished difference Result 149 states and 258 transitions. [2024-10-31 22:03:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:02,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 [2024-10-31 22:03:02,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:02,640 INFO L225 Difference]: With dead ends: 149 [2024-10-31 22:03:02,641 INFO L226 Difference]: Without dead ends: 149 [2024-10-31 22:03:02,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,643 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:02,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-31 22:03:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-10-31 22:03:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 256 transitions. [2024-10-31 22:03:02,666 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 256 transitions. Word has length 21 [2024-10-31 22:03:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:02,667 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 256 transitions. [2024-10-31 22:03:02,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2024-10-31 22:03:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 256 transitions. [2024-10-31 22:03:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:03:02,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:02,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:02,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:03:02,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:02,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1604678788, now seen corresponding path program 1 times [2024-10-31 22:03:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:02,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278497690] [2024-10-31 22:03:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:02,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:02,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278497690] [2024-10-31 22:03:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278497690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:02,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:02,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:02,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732132177] [2024-10-31 22:03:02,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:02,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:02,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:02,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:02,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,736 INFO L87 Difference]: Start difference. First operand 146 states and 256 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2024-10-31 22:03:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:02,765 INFO L93 Difference]: Finished difference Result 281 states and 486 transitions. [2024-10-31 22:03:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 [2024-10-31 22:03:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:02,768 INFO L225 Difference]: With dead ends: 281 [2024-10-31 22:03:02,769 INFO L226 Difference]: Without dead ends: 281 [2024-10-31 22:03:02,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,771 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:02,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-31 22:03:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2024-10-31 22:03:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7472924187725631) internal successors, (484), 277 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 484 transitions. [2024-10-31 22:03:02,791 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 484 transitions. Word has length 21 [2024-10-31 22:03:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:02,792 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 484 transitions. [2024-10-31 22:03:02,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2024-10-31 22:03:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 484 transitions. [2024-10-31 22:03:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:03:02,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:02,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:02,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:03:02,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -324815110, now seen corresponding path program 1 times [2024-10-31 22:03:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:02,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534634761] [2024-10-31 22:03:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:02,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534634761] [2024-10-31 22:03:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534634761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:02,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:02,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999634064] [2024-10-31 22:03:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:02,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,862 INFO L87 Difference]: Start difference. First operand 278 states and 484 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2024-10-31 22:03:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:02,879 INFO L93 Difference]: Finished difference Result 353 states and 618 transitions. [2024-10-31 22:03:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:02,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 [2024-10-31 22:03:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:02,882 INFO L225 Difference]: With dead ends: 353 [2024-10-31 22:03:02,882 INFO L226 Difference]: Without dead ends: 353 [2024-10-31 22:03:02,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,883 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 48 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:02,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-31 22:03:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 278. [2024-10-31 22:03:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 480 transitions. [2024-10-31 22:03:02,912 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 480 transitions. Word has length 21 [2024-10-31 22:03:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:02,912 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 480 transitions. [2024-10-31 22:03:02,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2024-10-31 22:03:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 480 transitions. [2024-10-31 22:03:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:03:02,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:02,914 INFO L215 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] [2024-10-31 22:03:02,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:03:02,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:02,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1801183710, now seen corresponding path program 1 times [2024-10-31 22:03:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:02,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753350248] [2024-10-31 22:03:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:02,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753350248] [2024-10-31 22:03:02,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753350248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:02,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:02,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614927595] [2024-10-31 22:03:02,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:02,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:02,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:02,980 INFO L87 Difference]: Start difference. First operand 278 states and 480 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,006 INFO L93 Difference]: Finished difference Result 517 states and 898 transitions. [2024-10-31 22:03:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-31 22:03:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,009 INFO L225 Difference]: With dead ends: 517 [2024-10-31 22:03:03,009 INFO L226 Difference]: Without dead ends: 517 [2024-10-31 22:03:03,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,011 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-31 22:03:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 386. [2024-10-31 22:03:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.7038961038961038) internal successors, (656), 385 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 656 transitions. [2024-10-31 22:03:03,025 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 656 transitions. Word has length 22 [2024-10-31 22:03:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 656 transitions. [2024-10-31 22:03:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 656 transitions. [2024-10-31 22:03:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:03:03,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,028 INFO L215 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] [2024-10-31 22:03:03,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:03:03,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,029 INFO L85 PathProgramCache]: Analyzing trace with hash 521320032, now seen corresponding path program 1 times [2024-10-31 22:03:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891001800] [2024-10-31 22:03:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891001800] [2024-10-31 22:03:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891001800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080463928] [2024-10-31 22:03:03,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,088 INFO L87 Difference]: Start difference. First operand 386 states and 656 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,113 INFO L93 Difference]: Finished difference Result 541 states and 910 transitions. [2024-10-31 22:03:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-31 22:03:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,116 INFO L225 Difference]: With dead ends: 541 [2024-10-31 22:03:03,116 INFO L226 Difference]: Without dead ends: 541 [2024-10-31 22:03:03,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,122 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-31 22:03:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 538. [2024-10-31 22:03:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.690875232774674) internal successors, (908), 537 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 908 transitions. [2024-10-31 22:03:03,154 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 908 transitions. Word has length 22 [2024-10-31 22:03:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,154 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 908 transitions. [2024-10-31 22:03:03,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 908 transitions. [2024-10-31 22:03:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:03:03,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,156 INFO L215 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] [2024-10-31 22:03:03,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:03:03,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash 8749319, now seen corresponding path program 1 times [2024-10-31 22:03:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641068039] [2024-10-31 22:03:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641068039] [2024-10-31 22:03:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641068039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616734250] [2024-10-31 22:03:03,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,202 INFO L87 Difference]: Start difference. First operand 538 states and 908 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,222 INFO L93 Difference]: Finished difference Result 553 states and 918 transitions. [2024-10-31 22:03:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-31 22:03:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,225 INFO L225 Difference]: With dead ends: 553 [2024-10-31 22:03:03,225 INFO L226 Difference]: Without dead ends: 553 [2024-10-31 22:03:03,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,226 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-31 22:03:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2024-10-31 22:03:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 916 transitions. [2024-10-31 22:03:03,246 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 916 transitions. Word has length 23 [2024-10-31 22:03:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,247 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 916 transitions. [2024-10-31 22:03:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 916 transitions. [2024-10-31 22:03:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:03:03,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,248 INFO L215 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] [2024-10-31 22:03:03,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:03:03,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1012319035, now seen corresponding path program 1 times [2024-10-31 22:03:03,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684686328] [2024-10-31 22:03:03,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684686328] [2024-10-31 22:03:03,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684686328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515767192] [2024-10-31 22:03:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,295 INFO L87 Difference]: Start difference. First operand 550 states and 916 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,315 INFO L93 Difference]: Finished difference Result 1001 states and 1678 transitions. [2024-10-31 22:03:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-31 22:03:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,319 INFO L225 Difference]: With dead ends: 1001 [2024-10-31 22:03:03,319 INFO L226 Difference]: Without dead ends: 1001 [2024-10-31 22:03:03,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,320 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 42 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-10-31 22:03:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 774. [2024-10-31 22:03:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1260 transitions. [2024-10-31 22:03:03,347 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1260 transitions. Word has length 23 [2024-10-31 22:03:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,348 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1260 transitions. [2024-10-31 22:03:03,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1260 transitions. [2024-10-31 22:03:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:03:03,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,350 INFO L215 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] [2024-10-31 22:03:03,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:03:03,350 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2002784583, now seen corresponding path program 1 times [2024-10-31 22:03:03,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543764047] [2024-10-31 22:03:03,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543764047] [2024-10-31 22:03:03,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543764047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682104885] [2024-10-31 22:03:03,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,397 INFO L87 Difference]: Start difference. First operand 774 states and 1260 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,429 INFO L93 Difference]: Finished difference Result 1065 states and 1718 transitions. [2024-10-31 22:03:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-31 22:03:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,434 INFO L225 Difference]: With dead ends: 1065 [2024-10-31 22:03:03,434 INFO L226 Difference]: Without dead ends: 1065 [2024-10-31 22:03:03,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,437 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-10-31 22:03:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1062. [2024-10-31 22:03:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1716 transitions. [2024-10-31 22:03:03,464 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1716 transitions. Word has length 23 [2024-10-31 22:03:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,464 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1716 transitions. [2024-10-31 22:03:03,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1716 transitions. [2024-10-31 22:03:03,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:03:03,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,466 INFO L215 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] [2024-10-31 22:03:03,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:03:03,469 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1310479285, now seen corresponding path program 1 times [2024-10-31 22:03:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542943776] [2024-10-31 22:03:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542943776] [2024-10-31 22:03:03,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542943776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287599962] [2024-10-31 22:03:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,505 INFO L87 Difference]: Start difference. First operand 1062 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,529 INFO L93 Difference]: Finished difference Result 1081 states and 1718 transitions. [2024-10-31 22:03:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-31 22:03:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,534 INFO L225 Difference]: With dead ends: 1081 [2024-10-31 22:03:03,534 INFO L226 Difference]: Without dead ends: 1081 [2024-10-31 22:03:03,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,535 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-10-31 22:03:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1078. [2024-10-31 22:03:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1716 transitions. [2024-10-31 22:03:03,568 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1716 transitions. Word has length 24 [2024-10-31 22:03:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,569 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1716 transitions. [2024-10-31 22:03:03,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1716 transitions. [2024-10-31 22:03:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:03:03,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,571 INFO L215 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] [2024-10-31 22:03:03,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:03:03,572 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1963419657, now seen corresponding path program 1 times [2024-10-31 22:03:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465354406] [2024-10-31 22:03:03,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465354406] [2024-10-31 22:03:03,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465354406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722443003] [2024-10-31 22:03:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,613 INFO L87 Difference]: Start difference. First operand 1078 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,636 INFO L93 Difference]: Finished difference Result 1929 states and 3094 transitions. [2024-10-31 22:03:03,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-31 22:03:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,644 INFO L225 Difference]: With dead ends: 1929 [2024-10-31 22:03:03,644 INFO L226 Difference]: Without dead ends: 1929 [2024-10-31 22:03:03,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,645 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-10-31 22:03:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1542. [2024-10-31 22:03:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2388 transitions. [2024-10-31 22:03:03,701 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2388 transitions. Word has length 24 [2024-10-31 22:03:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,701 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2388 transitions. [2024-10-31 22:03:03,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2388 transitions. [2024-10-31 22:03:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:03:03,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,704 INFO L215 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] [2024-10-31 22:03:03,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:03:03,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash 683555979, now seen corresponding path program 1 times [2024-10-31 22:03:03,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476271727] [2024-10-31 22:03:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476271727] [2024-10-31 22:03:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476271727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411219956] [2024-10-31 22:03:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,741 INFO L87 Difference]: Start difference. First operand 1542 states and 2388 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,770 INFO L93 Difference]: Finished difference Result 2089 states and 3206 transitions. [2024-10-31 22:03:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-31 22:03:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,779 INFO L225 Difference]: With dead ends: 2089 [2024-10-31 22:03:03,779 INFO L226 Difference]: Without dead ends: 2089 [2024-10-31 22:03:03,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,780 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-10-31 22:03:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2086. [2024-10-31 22:03:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 3204 transitions. [2024-10-31 22:03:03,832 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 3204 transitions. Word has length 24 [2024-10-31 22:03:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,833 INFO L471 AbstractCegarLoop]: Abstraction has 2086 states and 3204 transitions. [2024-10-31 22:03:03,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 3204 transitions. [2024-10-31 22:03:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:03:03,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,836 INFO L215 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] [2024-10-31 22:03:03,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:03:03,836 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 743117522, now seen corresponding path program 1 times [2024-10-31 22:03:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083931110] [2024-10-31 22:03:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083931110] [2024-10-31 22:03:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083931110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875607421] [2024-10-31 22:03:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,872 INFO L87 Difference]: Start difference. First operand 2086 states and 3204 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:03,895 INFO L93 Difference]: Finished difference Result 2121 states and 3206 transitions. [2024-10-31 22:03:03,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:03,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-31 22:03:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:03,903 INFO L225 Difference]: With dead ends: 2121 [2024-10-31 22:03:03,904 INFO L226 Difference]: Without dead ends: 2121 [2024-10-31 22:03:03,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,905 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:03,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2024-10-31 22:03:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2118. [2024-10-31 22:03:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3204 transitions. [2024-10-31 22:03:03,960 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3204 transitions. Word has length 25 [2024-10-31 22:03:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:03,960 INFO L471 AbstractCegarLoop]: Abstraction has 2118 states and 3204 transitions. [2024-10-31 22:03:03,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3204 transitions. [2024-10-31 22:03:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:03:03,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:03,964 INFO L215 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] [2024-10-31 22:03:03,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:03:03,964 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:03,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash -277950832, now seen corresponding path program 1 times [2024-10-31 22:03:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524897759] [2024-10-31 22:03:03,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:04,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:04,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524897759] [2024-10-31 22:03:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524897759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:04,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764567740] [2024-10-31 22:03:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:04,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:04,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,015 INFO L87 Difference]: Start difference. First operand 2118 states and 3204 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:04,045 INFO L93 Difference]: Finished difference Result 3721 states and 5670 transitions. [2024-10-31 22:03:04,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:04,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-31 22:03:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:04,058 INFO L225 Difference]: With dead ends: 3721 [2024-10-31 22:03:04,058 INFO L226 Difference]: Without dead ends: 3721 [2024-10-31 22:03:04,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,059 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:04,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-10-31 22:03:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3078. [2024-10-31 22:03:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4516 transitions. [2024-10-31 22:03:04,181 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4516 transitions. Word has length 25 [2024-10-31 22:03:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:04,182 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4516 transitions. [2024-10-31 22:03:04,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4516 transitions. [2024-10-31 22:03:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:03:04,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:04,186 INFO L215 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] [2024-10-31 22:03:04,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:03:04,187 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:04,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1557814510, now seen corresponding path program 1 times [2024-10-31 22:03:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:04,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710458027] [2024-10-31 22:03:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:04,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710458027] [2024-10-31 22:03:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710458027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:04,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:04,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106479851] [2024-10-31 22:03:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:04,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,223 INFO L87 Difference]: Start difference. First operand 3078 states and 4516 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:04,253 INFO L93 Difference]: Finished difference Result 4105 states and 5958 transitions. [2024-10-31 22:03:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:04,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-31 22:03:04,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:04,267 INFO L225 Difference]: With dead ends: 4105 [2024-10-31 22:03:04,267 INFO L226 Difference]: Without dead ends: 4105 [2024-10-31 22:03:04,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,268 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:04,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2024-10-31 22:03:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4102. [2024-10-31 22:03:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5956 transitions. [2024-10-31 22:03:04,365 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5956 transitions. Word has length 25 [2024-10-31 22:03:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:04,366 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 5956 transitions. [2024-10-31 22:03:04,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5956 transitions. [2024-10-31 22:03:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:03:04,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:04,371 INFO L215 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, 1] [2024-10-31 22:03:04,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:03:04,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash -19880330, now seen corresponding path program 1 times [2024-10-31 22:03:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:04,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464798542] [2024-10-31 22:03:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:04,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:04,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464798542] [2024-10-31 22:03:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464798542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:04,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:04,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:04,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198483755] [2024-10-31 22:03:04,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:04,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:04,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,404 INFO L87 Difference]: Start difference. First operand 4102 states and 5956 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:04,438 INFO L93 Difference]: Finished difference Result 4169 states and 5958 transitions. [2024-10-31 22:03:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:04,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-31 22:03:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:04,462 INFO L225 Difference]: With dead ends: 4169 [2024-10-31 22:03:04,462 INFO L226 Difference]: Without dead ends: 4169 [2024-10-31 22:03:04,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,463 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:04,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2024-10-31 22:03:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 4166. [2024-10-31 22:03:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4166 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 5956 transitions. [2024-10-31 22:03:04,613 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 5956 transitions. Word has length 26 [2024-10-31 22:03:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:04,613 INFO L471 AbstractCegarLoop]: Abstraction has 4166 states and 5956 transitions. [2024-10-31 22:03:04,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 5956 transitions. [2024-10-31 22:03:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:03:04,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:04,619 INFO L215 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, 1] [2024-10-31 22:03:04,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:03:04,620 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:04,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1040948684, now seen corresponding path program 1 times [2024-10-31 22:03:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446332265] [2024-10-31 22:03:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446332265] [2024-10-31 22:03:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446332265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527981145] [2024-10-31 22:03:04,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:04,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,658 INFO L87 Difference]: Start difference. First operand 4166 states and 5956 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:04,701 INFO L93 Difference]: Finished difference Result 7177 states and 10310 transitions. [2024-10-31 22:03:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:04,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-31 22:03:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:04,717 INFO L225 Difference]: With dead ends: 7177 [2024-10-31 22:03:04,717 INFO L226 Difference]: Without dead ends: 7177 [2024-10-31 22:03:04,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,718 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:04,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2024-10-31 22:03:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 6150. [2024-10-31 22:03:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6150 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 8516 transitions. [2024-10-31 22:03:04,853 INFO L78 Accepts]: Start accepts. Automaton has 6150 states and 8516 transitions. Word has length 26 [2024-10-31 22:03:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:04,853 INFO L471 AbstractCegarLoop]: Abstraction has 6150 states and 8516 transitions. [2024-10-31 22:03:04,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states and 8516 transitions. [2024-10-31 22:03:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:03:04,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:04,862 INFO L215 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, 1] [2024-10-31 22:03:04,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:03:04,862 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:04,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1974154934, now seen corresponding path program 1 times [2024-10-31 22:03:04,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:04,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035045373] [2024-10-31 22:03:04,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:04,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:04,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035045373] [2024-10-31 22:03:04,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035045373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:04,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:04,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594077565] [2024-10-31 22:03:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:04,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:04,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:04,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,893 INFO L87 Difference]: Start difference. First operand 6150 states and 8516 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:04,953 INFO L93 Difference]: Finished difference Result 8073 states and 11014 transitions. [2024-10-31 22:03:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-31 22:03:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:04,970 INFO L225 Difference]: With dead ends: 8073 [2024-10-31 22:03:04,971 INFO L226 Difference]: Without dead ends: 8073 [2024-10-31 22:03:04,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,972 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:04,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8073 states. [2024-10-31 22:03:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8073 to 8070. [2024-10-31 22:03:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8070 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8070 states to 8070 states and 11012 transitions. [2024-10-31 22:03:05,135 INFO L78 Accepts]: Start accepts. Automaton has 8070 states and 11012 transitions. Word has length 26 [2024-10-31 22:03:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:05,135 INFO L471 AbstractCegarLoop]: Abstraction has 8070 states and 11012 transitions. [2024-10-31 22:03:05,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 8070 states and 11012 transitions. [2024-10-31 22:03:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:03:05,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:05,145 INFO L215 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, 1, 1] [2024-10-31 22:03:05,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 22:03:05,145 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:05,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2097000605, now seen corresponding path program 1 times [2024-10-31 22:03:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:05,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753336098] [2024-10-31 22:03:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753336098] [2024-10-31 22:03:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753336098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:05,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984367434] [2024-10-31 22:03:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:05,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:05,176 INFO L87 Difference]: Start difference. First operand 8070 states and 11012 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:05,222 INFO L93 Difference]: Finished difference Result 8201 states and 11014 transitions. [2024-10-31 22:03:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:05,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-31 22:03:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:05,236 INFO L225 Difference]: With dead ends: 8201 [2024-10-31 22:03:05,237 INFO L226 Difference]: Without dead ends: 8201 [2024-10-31 22:03:05,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:05,238 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:05,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2024-10-31 22:03:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 8198. [2024-10-31 22:03:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8198 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8198 states to 8198 states and 11012 transitions. [2024-10-31 22:03:05,427 INFO L78 Accepts]: Start accepts. Automaton has 8198 states and 11012 transitions. Word has length 27 [2024-10-31 22:03:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:05,427 INFO L471 AbstractCegarLoop]: Abstraction has 8198 states and 11012 transitions. [2024-10-31 22:03:05,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 8198 states and 11012 transitions. [2024-10-31 22:03:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:03:05,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:05,436 INFO L215 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, 1, 1] [2024-10-31 22:03:05,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-31 22:03:05,436 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:05,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:05,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1075932251, now seen corresponding path program 1 times [2024-10-31 22:03:05,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:05,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658212371] [2024-10-31 22:03:05,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:05,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:05,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:05,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658212371] [2024-10-31 22:03:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658212371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:05,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:05,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290119700] [2024-10-31 22:03:05,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:05,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:05,465 INFO L87 Difference]: Start difference. First operand 8198 states and 11012 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:05,522 INFO L93 Difference]: Finished difference Result 13833 states and 18566 transitions. [2024-10-31 22:03:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:05,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-31 22:03:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:05,587 INFO L225 Difference]: With dead ends: 13833 [2024-10-31 22:03:05,587 INFO L226 Difference]: Without dead ends: 13833 [2024-10-31 22:03:05,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:05,588 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 30 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:05,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 126 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2024-10-31 22:03:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 12294. [2024-10-31 22:03:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12294 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 16004 transitions. [2024-10-31 22:03:05,874 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 16004 transitions. Word has length 27 [2024-10-31 22:03:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:05,875 INFO L471 AbstractCegarLoop]: Abstraction has 12294 states and 16004 transitions. [2024-10-31 22:03:05,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 16004 transitions. [2024-10-31 22:03:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:03:05,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:05,894 INFO L215 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, 1, 1] [2024-10-31 22:03:05,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-31 22:03:05,895 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:05,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash -203931427, now seen corresponding path program 1 times [2024-10-31 22:03:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:05,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864627450] [2024-10-31 22:03:05,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864627450] [2024-10-31 22:03:05,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864627450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:05,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:05,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474244694] [2024-10-31 22:03:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:05,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:05,929 INFO L87 Difference]: Start difference. First operand 12294 states and 16004 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:06,012 INFO L93 Difference]: Finished difference Result 15881 states and 20230 transitions. [2024-10-31 22:03:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-31 22:03:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:06,046 INFO L225 Difference]: With dead ends: 15881 [2024-10-31 22:03:06,046 INFO L226 Difference]: Without dead ends: 15881 [2024-10-31 22:03:06,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:06,047 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:06,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 167 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2024-10-31 22:03:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 15878. [2024-10-31 22:03:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15878 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15878 states to 15878 states and 20228 transitions. [2024-10-31 22:03:06,395 INFO L78 Accepts]: Start accepts. Automaton has 15878 states and 20228 transitions. Word has length 27 [2024-10-31 22:03:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:06,395 INFO L471 AbstractCegarLoop]: Abstraction has 15878 states and 20228 transitions. [2024-10-31 22:03:06,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 15878 states and 20228 transitions. [2024-10-31 22:03:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:03:06,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:06,414 INFO L215 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, 1, 1, 1] [2024-10-31 22:03:06,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-31 22:03:06,415 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:06,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash -999156575, now seen corresponding path program 1 times [2024-10-31 22:03:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639633817] [2024-10-31 22:03:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:06,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:06,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639633817] [2024-10-31 22:03:06,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639633817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:06,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:06,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:06,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393601553] [2024-10-31 22:03:06,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:06,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:06,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:06,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:06,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:06,542 INFO L87 Difference]: Start difference. First operand 15878 states and 20228 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:06,610 INFO L93 Difference]: Finished difference Result 16137 states and 20230 transitions. [2024-10-31 22:03:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:06,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-31 22:03:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:06,639 INFO L225 Difference]: With dead ends: 16137 [2024-10-31 22:03:06,639 INFO L226 Difference]: Without dead ends: 16137 [2024-10-31 22:03:06,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:06,640 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:06,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2024-10-31 22:03:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 16134. [2024-10-31 22:03:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16134 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16134 states to 16134 states and 20228 transitions. [2024-10-31 22:03:06,931 INFO L78 Accepts]: Start accepts. Automaton has 16134 states and 20228 transitions. Word has length 28 [2024-10-31 22:03:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:06,931 INFO L471 AbstractCegarLoop]: Abstraction has 16134 states and 20228 transitions. [2024-10-31 22:03:06,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states and 20228 transitions. [2024-10-31 22:03:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:03:06,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:06,949 INFO L215 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, 1, 1, 1] [2024-10-31 22:03:06,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-31 22:03:06,950 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:06,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2020224929, now seen corresponding path program 1 times [2024-10-31 22:03:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805775376] [2024-10-31 22:03:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:07,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:07,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805775376] [2024-10-31 22:03:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805775376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:07,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726529130] [2024-10-31 22:03:07,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:07,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:07,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:07,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:07,064 INFO L87 Difference]: Start difference. First operand 16134 states and 20228 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:07,178 INFO L93 Difference]: Finished difference Result 26633 states and 33030 transitions. [2024-10-31 22:03:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:07,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-31 22:03:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:07,238 INFO L225 Difference]: With dead ends: 26633 [2024-10-31 22:03:07,238 INFO L226 Difference]: Without dead ends: 26633 [2024-10-31 22:03:07,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:07,240 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:07,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:07,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26633 states. [2024-10-31 22:03:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26633 to 24582. [2024-10-31 22:03:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24582 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24582 states to 24582 states and 29956 transitions. [2024-10-31 22:03:07,744 INFO L78 Accepts]: Start accepts. Automaton has 24582 states and 29956 transitions. Word has length 28 [2024-10-31 22:03:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:07,745 INFO L471 AbstractCegarLoop]: Abstraction has 24582 states and 29956 transitions. [2024-10-31 22:03:07,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24582 states and 29956 transitions. [2024-10-31 22:03:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:03:07,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:07,779 INFO L215 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, 1, 1, 1] [2024-10-31 22:03:07,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-31 22:03:07,779 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:07,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 994878689, now seen corresponding path program 1 times [2024-10-31 22:03:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:07,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853905294] [2024-10-31 22:03:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:07,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:07,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853905294] [2024-10-31 22:03:07,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853905294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:07,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:07,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:07,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991205778] [2024-10-31 22:03:07,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:07,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:07,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:07,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:07,814 INFO L87 Difference]: Start difference. First operand 24582 states and 29956 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:07,906 INFO L93 Difference]: Finished difference Result 31241 states and 36870 transitions. [2024-10-31 22:03:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:07,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-31 22:03:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:07,966 INFO L225 Difference]: With dead ends: 31241 [2024-10-31 22:03:07,966 INFO L226 Difference]: Without dead ends: 31241 [2024-10-31 22:03:07,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:07,968 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:07,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31241 states. [2024-10-31 22:03:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31241 to 31238. [2024-10-31 22:03:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31238 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31238 states to 31238 states and 36868 transitions. [2024-10-31 22:03:08,867 INFO L78 Accepts]: Start accepts. Automaton has 31238 states and 36868 transitions. Word has length 28 [2024-10-31 22:03:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:08,868 INFO L471 AbstractCegarLoop]: Abstraction has 31238 states and 36868 transitions. [2024-10-31 22:03:08,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31238 states and 36868 transitions. [2024-10-31 22:03:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:03:08,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:08,906 INFO L215 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, 1, 1, 1, 1] [2024-10-31 22:03:08,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-31 22:03:08,907 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:08,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1804229224, now seen corresponding path program 1 times [2024-10-31 22:03:08,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:08,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845132410] [2024-10-31 22:03:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:08,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845132410] [2024-10-31 22:03:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845132410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:08,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100594325] [2024-10-31 22:03:08,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:08,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:08,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:08,957 INFO L87 Difference]: Start difference. First operand 31238 states and 36868 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:09,238 INFO L93 Difference]: Finished difference Result 31753 states and 36870 transitions. [2024-10-31 22:03:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:09,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-31 22:03:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:09,286 INFO L225 Difference]: With dead ends: 31753 [2024-10-31 22:03:09,287 INFO L226 Difference]: Without dead ends: 31753 [2024-10-31 22:03:09,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:09,287 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:09,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:03:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31753 states. [2024-10-31 22:03:09,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31753 to 31750. [2024-10-31 22:03:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31750 states, 31749 states have (on average 1.1612334246747928) internal successors, (36868), 31749 states have internal predecessors, (36868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31750 states to 31750 states and 36868 transitions. [2024-10-31 22:03:09,993 INFO L78 Accepts]: Start accepts. Automaton has 31750 states and 36868 transitions. Word has length 29 [2024-10-31 22:03:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:09,994 INFO L471 AbstractCegarLoop]: Abstraction has 31750 states and 36868 transitions. [2024-10-31 22:03:09,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 31750 states and 36868 transitions. [2024-10-31 22:03:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:03:10,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:10,022 INFO L215 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, 1, 1, 1, 1] [2024-10-31 22:03:10,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-31 22:03:10,022 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash 783160870, now seen corresponding path program 1 times [2024-10-31 22:03:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117776684] [2024-10-31 22:03:10,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117776684] [2024-10-31 22:03:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117776684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476720706] [2024-10-31 22:03:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:10,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:10,056 INFO L87 Difference]: Start difference. First operand 31750 states and 36868 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:10,247 INFO L93 Difference]: Finished difference Result 61446 states and 67588 transitions. [2024-10-31 22:03:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:10,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-31 22:03:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:10,305 INFO L225 Difference]: With dead ends: 61446 [2024-10-31 22:03:10,305 INFO L226 Difference]: Without dead ends: 31750 [2024-10-31 22:03:10,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:10,307 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 43 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:10,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 140 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2024-10-31 22:03:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31750. [2024-10-31 22:03:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31750 states, 31749 states have (on average 1.0967274559828657) internal successors, (34820), 31749 states have internal predecessors, (34820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31750 states to 31750 states and 34820 transitions. [2024-10-31 22:03:10,996 INFO L78 Accepts]: Start accepts. Automaton has 31750 states and 34820 transitions. Word has length 29 [2024-10-31 22:03:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:10,996 INFO L471 AbstractCegarLoop]: Abstraction has 31750 states and 34820 transitions. [2024-10-31 22:03:10,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 31750 states and 34820 transitions. [2024-10-31 22:03:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:03:11,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:11,020 INFO L215 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, 1, 1, 1, 1] [2024-10-31 22:03:11,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-31 22:03:11,021 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-31 22:03:11,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2063024548, now seen corresponding path program 1 times [2024-10-31 22:03:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375168082] [2024-10-31 22:03:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375168082] [2024-10-31 22:03:11,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375168082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:11,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150013572] [2024-10-31 22:03:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:11,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:11,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:11,057 INFO L87 Difference]: Start difference. First operand 31750 states and 34820 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:11,429 INFO L93 Difference]: Finished difference Result 31747 states and 33794 transitions. [2024-10-31 22:03:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:11,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-31 22:03:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:11,430 INFO L225 Difference]: With dead ends: 31747 [2024-10-31 22:03:11,430 INFO L226 Difference]: Without dead ends: 0 [2024-10-31 22:03:11,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:11,431 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:11,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-31 22:03:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-31 22:03:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-31 22:03:11,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-10-31 22:03:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:11,433 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-31 22:03:11,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-31 22:03:11,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-31 22:03:11,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-10-31 22:03:11,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-10-31 22:03:11,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-31 22:03:11,441 INFO L407 BasicCegarLoop]: Path program 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:11,444 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:03:11,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:03:11 BoogieIcfgContainer [2024-10-31 22:03:11,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:03:11,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:03:11,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:03:11,449 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:03:11,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:01" (3/4) ... [2024-10-31 22:03:11,455 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-10-31 22:03:11,470 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-31 22:03:11,471 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-31 22:03:11,471 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-31 22:03:11,472 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-31 22:03:11,624 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:03:11,625 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/witness.yml [2024-10-31 22:03:11,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:03:11,629 INFO L158 Benchmark]: Toolchain (without parser) took 11558.97ms. Allocated memory was 125.8MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 89.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 411.1MB. Max. memory is 16.1GB. [2024-10-31 22:03:11,629 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:03:11,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.51ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 75.5MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:03:11,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.42ms. Allocated memory is still 125.8MB. Free memory was 75.5MB in the beginning and 73.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:03:11,630 INFO L158 Benchmark]: Boogie Preprocessor took 57.35ms. Allocated memory is still 125.8MB. Free memory was 73.8MB in the beginning and 72.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:03:11,630 INFO L158 Benchmark]: RCFGBuilder took 557.94ms. Allocated memory is still 125.8MB. Free memory was 71.7MB in the beginning and 55.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:03:11,630 INFO L158 Benchmark]: TraceAbstraction took 10375.51ms. Allocated memory was 125.8MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 55.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 371.3MB. Max. memory is 16.1GB. [2024-10-31 22:03:11,631 INFO L158 Benchmark]: Witness Printer took 179.15ms. Allocated memory is still 4.4GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:03:11,632 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.51ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 75.5MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.42ms. Allocated memory is still 125.8MB. Free memory was 75.5MB in the beginning and 73.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.35ms. Allocated memory is still 125.8MB. Free memory was 73.8MB in the beginning and 72.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 557.94ms. Allocated memory is still 125.8MB. Free memory was 71.7MB in the beginning and 55.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10375.51ms. Allocated memory was 125.8MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 55.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 371.3MB. Max. memory is 16.1GB. * Witness Printer took 179.15ms. Allocated memory is still 4.4GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1494 mSDsluCounter, 4807 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1861 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2946 mSDtfsCounter, 164 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31750occurred in iteration=31, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 6205 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 762 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 1540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-31 22:03:11,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fec9082-130b-45d4-b51f-7e09dedbbc83/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE