./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd --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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:26:43,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:26:43,678 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 16:26:43,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:26:43,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:26:43,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:26:43,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:26:43,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:26:43,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:26:43,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:26:43,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:26:43,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:26:43,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:26:43,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:26:43,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:26:43,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:26:43,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:26:43,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:26:43,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:26:43,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:26:43,744 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 16:26:43,744 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 16:26:43,744 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 16:26:43,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:26:43,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:26:43,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:26:43,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:26:43,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:26:43,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:26:43,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:26:43,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:26:43,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:26:43,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:26:43,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:26:43,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:26:43,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:26:43,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:26:43,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:26:43,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:26:43,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:26:43,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:26:43,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:26:43,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2024-11-13 16:26:44,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:26:44,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:26:44,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:26:44,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:26:44,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:26:44,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/locks/test_locks_6.c Unable to find full path for "g++" [2024-11-13 16:26:46,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:26:46,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:26:46,882 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/sv-benchmarks/c/locks/test_locks_6.c [2024-11-13 16:26:46,896 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/data/8544da936/105d39a6d16b45eeaa117c784e044655/FLAG62005c7c0 [2024-11-13 16:26:46,928 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/data/8544da936/105d39a6d16b45eeaa117c784e044655 [2024-11-13 16:26:46,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:26:46,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:26:46,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:26:46,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:26:46,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:26:46,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:26:46" (1/1) ... [2024-11-13 16:26:46,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97c471b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:46, skipping insertion in model container [2024-11-13 16:26:46,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:26:46" (1/1) ... [2024-11-13 16:26:46,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:26:47,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:26:47,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:26:47,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:26:47,164 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:26:47,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47 WrapperNode [2024-11-13 16:26:47,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:26:47,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:26:47,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:26:47,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:26:47,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,200 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-11-13 16:26:47,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:26:47,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:26:47,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:26:47,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:26:47,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,223 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-11-13 16:26:47,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:26:47,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:26:47,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:26:47,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:26:47,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (1/1) ... [2024-11-13 16:26:47,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:26:47,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:26:47,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:26:47,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:26:47,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:26:47,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:26:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:26:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:26:47,407 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:26:47,410 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:26:47,685 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-13 16:26:47,685 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:26:47,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:26:47,710 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:26:47,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:26:47 BoogieIcfgContainer [2024-11-13 16:26:47,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:26:47,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:26:47,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:26:47,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:26:47,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:26:46" (1/3) ... [2024-11-13 16:26:47,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7515a093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:26:47, skipping insertion in model container [2024-11-13 16:26:47,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:26:47" (2/3) ... [2024-11-13 16:26:47,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7515a093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:26:47, skipping insertion in model container [2024-11-13 16:26:47,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:26:47" (3/3) ... [2024-11-13 16:26:47,727 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2024-11-13 16:26:47,749 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:26:47,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_6.c that has 1 procedures, 31 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 16:26:47,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:26:47,841 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;@394b162e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:26:47,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 16:26:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 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-11-13 16:26:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 16:26:47,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:47,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 16:26:47,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:47,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash 28806972, now seen corresponding path program 1 times [2024-11-13 16:26:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:47,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149942724] [2024-11-13 16:26:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:48,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149942724] [2024-11-13 16:26:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149942724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:48,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:26:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971335463] [2024-11-13 16:26:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:48,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:26:48,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:26:48,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:26:48,129 INFO L87 Difference]: Start difference. First operand has 31 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 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-11-13 16:26:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:48,146 INFO L93 Difference]: Finished difference Result 30 states and 47 transitions. [2024-11-13 16:26:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:26:48,148 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-11-13 16:26:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:48,156 INFO L225 Difference]: With dead ends: 30 [2024-11-13 16:26:48,156 INFO L226 Difference]: Without dead ends: 28 [2024-11-13 16:26:48,159 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-11-13 16:26:48,162 INFO L432 NwaCegarLoop]: 47 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, 47 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-11-13 16:26:48,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-13 16:26:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-13 16:26:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 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-11-13 16:26:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2024-11-13 16:26:48,202 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 5 [2024-11-13 16:26:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:48,202 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-11-13 16:26:48,203 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-11-13 16:26:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2024-11-13 16:26:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 16:26:48,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:48,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 16:26:48,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:26:48,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:48,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash 889665006, now seen corresponding path program 1 times [2024-11-13 16:26:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:48,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695492266] [2024-11-13 16:26:48,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:48,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:48,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695492266] [2024-11-13 16:26:48,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695492266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:48,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:48,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:26:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604858751] [2024-11-13 16:26:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:48,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:48,295 INFO L87 Difference]: Start difference. First operand 28 states and 45 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-11-13 16:26:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:48,305 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2024-11-13 16:26:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:48,306 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-11-13 16:26:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:48,307 INFO L225 Difference]: With dead ends: 27 [2024-11-13 16:26:48,307 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 16:26:48,307 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-11-13 16:26:48,308 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 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-11-13 16:26:48,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 16:26:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-13 16:26:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2024-11-13 16:26:48,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 6 [2024-11-13 16:26:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:48,314 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. [2024-11-13 16:26:48,314 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-11-13 16:26:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. [2024-11-13 16:26:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 16:26:48,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:48,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:48,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:26:48,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:48,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash 129767228, now seen corresponding path program 1 times [2024-11-13 16:26:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:48,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423220967] [2024-11-13 16:26:48,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:48,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:48,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:48,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423220967] [2024-11-13 16:26:48,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423220967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:48,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:48,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:48,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115695320] [2024-11-13 16:26:48,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:48,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:48,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:48,411 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-13 16:26:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:48,461 INFO L93 Difference]: Finished difference Result 47 states and 79 transitions. [2024-11-13 16:26:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:48,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-13 16:26:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:48,464 INFO L225 Difference]: With dead ends: 47 [2024-11-13 16:26:48,464 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 16:26:48,464 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-11-13 16:26:48,465 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 82 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-11-13 16:26:48,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 82 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 16:26:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2024-11-13 16:26:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 16:26:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 55 transitions. [2024-11-13 16:26:48,480 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 55 transitions. Word has length 14 [2024-11-13 16:26:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:48,480 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 55 transitions. [2024-11-13 16:26:48,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-13 16:26:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 55 transitions. [2024-11-13 16:26:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 16:26:48,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:48,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:48,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:26:48,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:48,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash -263259782, now seen corresponding path program 1 times [2024-11-13 16:26:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:48,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162640281] [2024-11-13 16:26:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162640281] [2024-11-13 16:26:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162640281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181596901] [2024-11-13 16:26:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:48,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:48,582 INFO L87 Difference]: Start difference. First operand 32 states and 55 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-13 16:26:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:48,618 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2024-11-13 16:26:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:48,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-13 16:26:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:48,622 INFO L225 Difference]: With dead ends: 47 [2024-11-13 16:26:48,622 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 16:26:48,622 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-11-13 16:26:48,623 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 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-11-13 16:26:48,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 16:26:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-13 16:26:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 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-11-13 16:26:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 75 transitions. [2024-11-13 16:26:48,636 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 75 transitions. Word has length 14 [2024-11-13 16:26:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:48,640 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 75 transitions. [2024-11-13 16:26:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-13 16:26:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 75 transitions. [2024-11-13 16:26:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 16:26:48,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:48,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:48,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:26:48,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:48,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:48,643 INFO L85 PathProgramCache]: Analyzing trace with hash -265533015, now seen corresponding path program 1 times [2024-11-13 16:26:48,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:48,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792630590] [2024-11-13 16:26:48,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:48,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792630590] [2024-11-13 16:26:48,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792630590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:48,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578741496] [2024-11-13 16:26:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:48,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:48,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:48,767 INFO L87 Difference]: Start difference. First operand 44 states and 75 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:48,791 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2024-11-13 16:26:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 16:26:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:48,793 INFO L225 Difference]: With dead ends: 50 [2024-11-13 16:26:48,793 INFO L226 Difference]: Without dead ends: 50 [2024-11-13 16:26:48,793 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-11-13 16:26:48,794 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 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-11-13 16:26:48,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-13 16:26:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-13 16:26:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 77 transitions. [2024-11-13 16:26:48,802 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 77 transitions. Word has length 15 [2024-11-13 16:26:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:48,802 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 77 transitions. [2024-11-13 16:26:48,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 77 transitions. [2024-11-13 16:26:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 16:26:48,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:48,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:48,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:26:48,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:48,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash 435531563, now seen corresponding path program 1 times [2024-11-13 16:26:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:48,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377450628] [2024-11-13 16:26:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:48,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377450628] [2024-11-13 16:26:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377450628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:48,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517954340] [2024-11-13 16:26:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:48,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:48,875 INFO L87 Difference]: Start difference. First operand 47 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:48,897 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2024-11-13 16:26:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:48,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 16:26:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:48,899 INFO L225 Difference]: With dead ends: 85 [2024-11-13 16:26:48,899 INFO L226 Difference]: Without dead ends: 85 [2024-11-13 16:26:48,899 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-11-13 16:26:48,900 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 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-11-13 16:26:48,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-13 16:26:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2024-11-13 16:26:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 102 transitions. [2024-11-13 16:26:48,908 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 102 transitions. Word has length 15 [2024-11-13 16:26:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:48,908 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 102 transitions. [2024-11-13 16:26:48,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 102 transitions. [2024-11-13 16:26:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 16:26:48,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:48,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:48,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:26:48,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:48,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 42504553, now seen corresponding path program 1 times [2024-11-13 16:26:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:48,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999639162] [2024-11-13 16:26:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999639162] [2024-11-13 16:26:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999639162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862357305] [2024-11-13 16:26:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,001 INFO L87 Difference]: Start difference. First operand 62 states and 102 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,025 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2024-11-13 16:26:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 16:26:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,027 INFO L225 Difference]: With dead ends: 87 [2024-11-13 16:26:49,027 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 16:26:49,027 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-11-13 16:26:49,028 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 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-11-13 16:26:49,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 16:26:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-13 16:26:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 0 states have call successors, (0), 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-11-13 16:26:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 136 transitions. [2024-11-13 16:26:49,049 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 136 transitions. Word has length 15 [2024-11-13 16:26:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 136 transitions. [2024-11-13 16:26:49,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 136 transitions. [2024-11-13 16:26:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 16:26:49,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:49,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:26:49,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 623237349, now seen corresponding path program 1 times [2024-11-13 16:26:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803909662] [2024-11-13 16:26:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803909662] [2024-11-13 16:26:49,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803909662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691120470] [2024-11-13 16:26:49,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,113 INFO L87 Difference]: Start difference. First operand 84 states and 136 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-13 16:26:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,147 INFO L93 Difference]: Finished difference Result 89 states and 138 transitions. [2024-11-13 16:26:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-13 16:26:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,149 INFO L225 Difference]: With dead ends: 89 [2024-11-13 16:26:49,149 INFO L226 Difference]: Without dead ends: 89 [2024-11-13 16:26:49,149 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-11-13 16:26:49,150 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 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-11-13 16:26:49,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-13 16:26:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-13 16:26:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 0 states have call successors, (0), 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-11-13 16:26:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. [2024-11-13 16:26:49,171 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 16 [2024-11-13 16:26:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,171 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. [2024-11-13 16:26:49,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-13 16:26:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. [2024-11-13 16:26:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 16:26:49,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:49,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:26:49,173 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1324301927, now seen corresponding path program 1 times [2024-11-13 16:26:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153653875] [2024-11-13 16:26:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153653875] [2024-11-13 16:26:49,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153653875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250766266] [2024-11-13 16:26:49,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,238 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-13 16:26:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,278 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2024-11-13 16:26:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-13 16:26:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,282 INFO L225 Difference]: With dead ends: 161 [2024-11-13 16:26:49,283 INFO L226 Difference]: Without dead ends: 161 [2024-11-13 16:26:49,283 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-11-13 16:26:49,284 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 82 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-11-13 16:26:49,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 82 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-13 16:26:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-11-13 16:26:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5541401273885351) internal successors, (244), 157 states have internal predecessors, (244), 0 states have call successors, (0), 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-11-13 16:26:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 244 transitions. [2024-11-13 16:26:49,297 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 244 transitions. Word has length 16 [2024-11-13 16:26:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,297 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 244 transitions. [2024-11-13 16:26:49,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-13 16:26:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions. [2024-11-13 16:26:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 16:26:49,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:49,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:26:49,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1717328937, now seen corresponding path program 1 times [2024-11-13 16:26:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458636280] [2024-11-13 16:26:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458636280] [2024-11-13 16:26:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458636280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679714446] [2024-11-13 16:26:49,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,342 INFO L87 Difference]: Start difference. First operand 158 states and 244 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-13 16:26:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,360 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-13 16:26:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-13 16:26:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,362 INFO L225 Difference]: With dead ends: 193 [2024-11-13 16:26:49,363 INFO L226 Difference]: Without dead ends: 193 [2024-11-13 16:26:49,363 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-11-13 16:26:49,364 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 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-11-13 16:26:49,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-13 16:26:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 158. [2024-11-13 16:26:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 0 states have call successors, (0), 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-11-13 16:26:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 240 transitions. [2024-11-13 16:26:49,384 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 240 transitions. Word has length 16 [2024-11-13 16:26:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,385 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 240 transitions. [2024-11-13 16:26:49,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-13 16:26:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2024-11-13 16:26:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 16:26:49,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:49,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:26:49,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1889641868, now seen corresponding path program 1 times [2024-11-13 16:26:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977898910] [2024-11-13 16:26:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977898910] [2024-11-13 16:26:49,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977898910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208545156] [2024-11-13 16:26:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,434 INFO L87 Difference]: Start difference. First operand 158 states and 240 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,452 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2024-11-13 16:26:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 16:26:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,458 INFO L225 Difference]: With dead ends: 277 [2024-11-13 16:26:49,458 INFO L226 Difference]: Without dead ends: 277 [2024-11-13 16:26:49,459 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-11-13 16:26:49,459 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 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-11-13 16:26:49,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-13 16:26:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 226. [2024-11-13 16:26:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4933333333333334) internal successors, (336), 225 states have internal predecessors, (336), 0 states have call successors, (0), 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-11-13 16:26:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 336 transitions. [2024-11-13 16:26:49,487 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 336 transitions. Word has length 17 [2024-11-13 16:26:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,488 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 336 transitions. [2024-11-13 16:26:49,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 336 transitions. [2024-11-13 16:26:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 16:26:49,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:49,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:26:49,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2012298418, now seen corresponding path program 1 times [2024-11-13 16:26:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871483469] [2024-11-13 16:26:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871483469] [2024-11-13 16:26:49,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871483469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053805751] [2024-11-13 16:26:49,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,532 INFO L87 Difference]: Start difference. First operand 226 states and 336 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,552 INFO L93 Difference]: Finished difference Result 301 states and 430 transitions. [2024-11-13 16:26:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 16:26:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,554 INFO L225 Difference]: With dead ends: 301 [2024-11-13 16:26:49,555 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 16:26:49,555 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-11-13 16:26:49,556 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 92 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-11-13 16:26:49,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 92 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 16:26:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2024-11-13 16:26:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4410774410774412) internal successors, (428), 297 states have internal predecessors, (428), 0 states have call successors, (0), 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-11-13 16:26:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 428 transitions. [2024-11-13 16:26:49,568 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 428 transitions. Word has length 17 [2024-11-13 16:26:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,569 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 428 transitions. [2024-11-13 16:26:49,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:26:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 428 transitions. [2024-11-13 16:26:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 16:26:49,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:49,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:26:49,571 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1557326162, now seen corresponding path program 1 times [2024-11-13 16:26:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305708095] [2024-11-13 16:26:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305708095] [2024-11-13 16:26:49,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305708095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371320299] [2024-11-13 16:26:49,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,639 INFO L87 Difference]: Start difference. First operand 298 states and 428 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-13 16:26:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,663 INFO L93 Difference]: Finished difference Result 313 states and 438 transitions. [2024-11-13 16:26:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-13 16:26:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,666 INFO L225 Difference]: With dead ends: 313 [2024-11-13 16:26:49,666 INFO L226 Difference]: Without dead ends: 313 [2024-11-13 16:26:49,666 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-11-13 16:26:49,667 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 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-11-13 16:26:49,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-13 16:26:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-11-13 16:26:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 0 states have call successors, (0), 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-11-13 16:26:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 436 transitions. [2024-11-13 16:26:49,685 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 436 transitions. Word has length 18 [2024-11-13 16:26:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,685 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 436 transitions. [2024-11-13 16:26:49,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-13 16:26:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 436 transitions. [2024-11-13 16:26:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 16:26:49,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:49,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:26:49,688 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2036576556, now seen corresponding path program 1 times [2024-11-13 16:26:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561721180] [2024-11-13 16:26:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561721180] [2024-11-13 16:26:49,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561721180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423221313] [2024-11-13 16:26:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,731 INFO L87 Difference]: Start difference. First operand 310 states and 436 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-13 16:26:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,762 INFO L93 Difference]: Finished difference Result 521 states and 718 transitions. [2024-11-13 16:26:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-13 16:26:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,765 INFO L225 Difference]: With dead ends: 521 [2024-11-13 16:26:49,766 INFO L226 Difference]: Without dead ends: 521 [2024-11-13 16:26:49,766 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-11-13 16:26:49,767 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 74 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-11-13 16:26:49,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-13 16:26:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 454. [2024-11-13 16:26:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 0 states have call successors, (0), 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-11-13 16:26:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 620 transitions. [2024-11-13 16:26:49,819 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 620 transitions. Word has length 18 [2024-11-13 16:26:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,819 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 620 transitions. [2024-11-13 16:26:49,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-13 16:26:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 620 transitions. [2024-11-13 16:26:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 16:26:49,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:49,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:26:49,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1865363730, now seen corresponding path program 1 times [2024-11-13 16:26:49,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343351252] [2024-11-13 16:26:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343351252] [2024-11-13 16:26:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343351252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381970821] [2024-11-13 16:26:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,881 INFO L87 Difference]: Start difference. First operand 454 states and 620 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-13 16:26:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:49,906 INFO L93 Difference]: Finished difference Result 585 states and 758 transitions. [2024-11-13 16:26:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-13 16:26:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:49,909 INFO L225 Difference]: With dead ends: 585 [2024-11-13 16:26:49,909 INFO L226 Difference]: Without dead ends: 585 [2024-11-13 16:26:49,910 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-11-13 16:26:49,911 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 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-11-13 16:26:49,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-13 16:26:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2024-11-13 16:26:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 0 states have call successors, (0), 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-11-13 16:26:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 756 transitions. [2024-11-13 16:26:49,939 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 756 transitions. Word has length 18 [2024-11-13 16:26:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:49,939 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 756 transitions. [2024-11-13 16:26:49,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-13 16:26:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 756 transitions. [2024-11-13 16:26:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 16:26:49,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:49,941 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-11-13 16:26:49,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:26:49,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:49,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1297328701, now seen corresponding path program 1 times [2024-11-13 16:26:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:49,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617723342] [2024-11-13 16:26:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617723342] [2024-11-13 16:26:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617723342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457025366] [2024-11-13 16:26:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:49,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:49,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:49,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:49,976 INFO L87 Difference]: Start difference. First operand 582 states and 756 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-11-13 16:26:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:50,002 INFO L93 Difference]: Finished difference Result 601 states and 758 transitions. [2024-11-13 16:26:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:50,004 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-11-13 16:26:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:50,007 INFO L225 Difference]: With dead ends: 601 [2024-11-13 16:26:50,007 INFO L226 Difference]: Without dead ends: 601 [2024-11-13 16:26:50,007 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-11-13 16:26:50,011 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 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-11-13 16:26:50,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-13 16:26:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2024-11-13 16:26:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 0 states have call successors, (0), 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-11-13 16:26:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 756 transitions. [2024-11-13 16:26:50,041 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 756 transitions. Word has length 19 [2024-11-13 16:26:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:50,043 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 756 transitions. [2024-11-13 16:26:50,043 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-11-13 16:26:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 756 transitions. [2024-11-13 16:26:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 16:26:50,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:50,049 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-11-13 16:26:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 16:26:50,050 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:50,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1998393279, now seen corresponding path program 1 times [2024-11-13 16:26:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294532663] [2024-11-13 16:26:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:50,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294532663] [2024-11-13 16:26:50,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294532663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:50,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964933696] [2024-11-13 16:26:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:50,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:50,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:50,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:50,084 INFO L87 Difference]: Start difference. First operand 598 states and 756 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-11-13 16:26:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:50,105 INFO L93 Difference]: Finished difference Result 966 states and 1172 transitions. [2024-11-13 16:26:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:50,106 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-11-13 16:26:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:50,110 INFO L225 Difference]: With dead ends: 966 [2024-11-13 16:26:50,110 INFO L226 Difference]: Without dead ends: 966 [2024-11-13 16:26:50,110 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-11-13 16:26:50,111 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 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-11-13 16:26:50,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-13 16:26:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 902. [2024-11-13 16:26:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 0 states have call successors, (0), 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-11-13 16:26:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1108 transitions. [2024-11-13 16:26:50,141 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1108 transitions. Word has length 19 [2024-11-13 16:26:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:50,141 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1108 transitions. [2024-11-13 16:26:50,142 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-11-13 16:26:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1108 transitions. [2024-11-13 16:26:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 16:26:50,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:26:50,144 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-11-13 16:26:50,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 16:26:50,144 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-13 16:26:50,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:26:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1605366269, now seen corresponding path program 1 times [2024-11-13 16:26:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:26:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413199694] [2024-11-13 16:26:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:26:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:26:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:26:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:26:50,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:26:50,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413199694] [2024-11-13 16:26:50,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413199694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:26:50,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:26:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:26:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115312236] [2024-11-13 16:26:50,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:26:50,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:26:50,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:26:50,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:26:50,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:26:50,177 INFO L87 Difference]: Start difference. First operand 902 states and 1108 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-11-13 16:26:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:26:50,207 INFO L93 Difference]: Finished difference Result 1123 states and 1282 transitions. [2024-11-13 16:26:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:26:50,208 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-11-13 16:26:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:26:50,208 INFO L225 Difference]: With dead ends: 1123 [2024-11-13 16:26:50,208 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 16:26:50,209 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-11-13 16:26:50,210 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 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-11-13 16:26:50,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:26:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 16:26:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 16:26:50,211 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-11-13 16:26:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 16:26:50,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-11-13 16:26:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:26:50,212 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 16:26:50,212 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-11-13 16:26:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 16:26:50,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 16:26:50,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-13 16:26:50,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-13 16:26:50,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 16:26:50,222 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:26:50,225 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:26:50,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:26:50 BoogieIcfgContainer [2024-11-13 16:26:50,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:26:50,231 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:26:50,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:26:50,232 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:26:50,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:26:47" (3/4) ... [2024-11-13 16:26:50,236 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 16:26:50,249 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-13 16:26:50,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 16:26:50,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 16:26:50,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 16:26:50,352 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:26:50,352 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 16:26:50,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:26:50,354 INFO L158 Benchmark]: Toolchain (without parser) took 3419.95ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 45.3MB in the end (delta: 47.6MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-11-13 16:26:50,354 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:26:50,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.78ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 81.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:26:50,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.24ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:26:50,355 INFO L158 Benchmark]: Boogie Preprocessor took 35.66ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:26:50,356 INFO L158 Benchmark]: RCFGBuilder took 474.18ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 67.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:26:50,356 INFO L158 Benchmark]: TraceAbstraction took 2515.87ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 50.6MB in the end (delta: 16.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-13 16:26:50,357 INFO L158 Benchmark]: Witness Printer took 121.48ms. Allocated memory is still 117.4MB. Free memory was 50.6MB in the beginning and 45.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:26:50,359 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.50ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.78ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 81.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.24ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.66ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 474.18ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 67.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2515.87ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 50.6MB in the end (delta: 16.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Witness Printer took 121.48ms. Allocated memory is still 117.4MB. Free memory was 50.6MB in the beginning and 45.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. 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, 31 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 1474 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 538 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 936 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=17, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 282 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-13 16:26:50,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53877584-0201-42b1-b56a-01c66a2f4018/bin/uautomizer-verify-qhAvR1uOyd/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