/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:49:04,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:49:04,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:49:04,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:49:04,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:49:04,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:49:04,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:49:04,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:49:04,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:49:04,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:49:04,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:49:04,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:49:04,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:49:04,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:49:04,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:49:04,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:49:04,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:49:04,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:49:04,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:49:04,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:49:04,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:49:04,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:49:04,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:49:04,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:49:04,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:49:04,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:49:04,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:49:04,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:49:04,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:49:04,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:49:04,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:49:04,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:49:04,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:49:04,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:49:04,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:49:04,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:49:04,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:49:04,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:49:04,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:49:04,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:49:04,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:49:04,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:49:04,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:49:04,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:49:04,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:49:04,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:49:04,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:49:04,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:49:04,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:49:04,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:49:04,408 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:49:04,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:49:04,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:49:04,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:49:04,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:49:04,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:49:04,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:49:04,411 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:49:04,411 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:49:04,412 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:49:04,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:49:04,412 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:49:04,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:49:04,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:49:04,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:49:04,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:49:04,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:49:04,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:49:04,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:49:04,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:49:04,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:49:04,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:49:04,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:49:04,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:49:04,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:49:04,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:49:04,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:49:04,928 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:49:04,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-10-15 17:49:04,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1292471d/ee98549ec555433abb73fb8a5c56b11c/FLAG5e9a35bf1 [2022-10-15 17:49:05,845 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:49:05,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-10-15 17:49:05,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1292471d/ee98549ec555433abb73fb8a5c56b11c/FLAG5e9a35bf1 [2022-10-15 17:49:06,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1292471d/ee98549ec555433abb73fb8a5c56b11c [2022-10-15 17:49:06,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:49:06,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:49:06,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:49:06,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:49:06,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:49:06,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:06,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62df7b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06, skipping insertion in model container [2022-10-15 17:49:06,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:06,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:49:06,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:49:06,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-10-15 17:49:06,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:49:06,595 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:49:06,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-10-15 17:49:06,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:49:06,857 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:49:06,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06 WrapperNode [2022-10-15 17:49:06,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:49:06,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:49:06,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:49:06,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:49:06,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:06,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,014 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 846 [2022-10-15 17:49:07,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:49:07,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:49:07,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:49:07,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:49:07,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,116 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:49:07,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:49:07,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:49:07,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:49:07,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (1/1) ... [2022-10-15 17:49:07,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:49:07,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:07,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:49:07,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:49:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:49:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:49:07,303 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-10-15 17:49:07,304 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-10-15 17:49:07,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:49:07,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:49:07,457 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:49:07,460 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:49:08,652 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:49:08,667 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:49:08,667 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-10-15 17:49:08,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:49:08 BoogieIcfgContainer [2022-10-15 17:49:08,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:49:08,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:49:08,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:49:08,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:49:08,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:49:06" (1/3) ... [2022-10-15 17:49:08,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58265d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:49:08, skipping insertion in model container [2022-10-15 17:49:08,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:06" (2/3) ... [2022-10-15 17:49:08,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58265d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:49:08, skipping insertion in model container [2022-10-15 17:49:08,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:49:08" (3/3) ... [2022-10-15 17:49:08,683 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2022-10-15 17:49:08,712 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:49:08,712 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:49:08,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:49:08,817 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@128c1d9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:49:08,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:49:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 263 states have (on average 1.855513307984791) internal successors, (488), 270 states have internal predecessors, (488), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:49:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:49:08,835 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:08,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:08,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash -146975938, now seen corresponding path program 1 times [2022-10-15 17:49:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:08,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790891838] [2022-10-15 17:49:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:09,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790891838] [2022-10-15 17:49:09,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790891838] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:09,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:09,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:09,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259114636] [2022-10-15 17:49:09,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:09,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:09,282 INFO L87 Difference]: Start difference. First operand has 272 states, 263 states have (on average 1.855513307984791) internal successors, (488), 270 states have internal predecessors, (488), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:09,753 INFO L93 Difference]: Finished difference Result 448 states and 693 transitions. [2022-10-15 17:49:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:09,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 17:49:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:09,775 INFO L225 Difference]: With dead ends: 448 [2022-10-15 17:49:09,775 INFO L226 Difference]: Without dead ends: 444 [2022-10-15 17:49:09,777 INFO L412 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 [2022-10-15 17:49:09,783 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 256 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:09,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 767 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 17:49:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-10-15 17:49:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 428. [2022-10-15 17:49:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 421 states have (on average 1.5914489311163895) internal successors, (670), 426 states have internal predecessors, (670), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 675 transitions. [2022-10-15 17:49:09,876 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 675 transitions. Word has length 11 [2022-10-15 17:49:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:09,877 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 675 transitions. [2022-10-15 17:49:09,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 675 transitions. [2022-10-15 17:49:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 17:49:09,879 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:09,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:09,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:49:09,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1832348943, now seen corresponding path program 1 times [2022-10-15 17:49:09,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:09,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796109811] [2022-10-15 17:49:09,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:09,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:10,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:10,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796109811] [2022-10-15 17:49:10,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796109811] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:10,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:10,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449586063] [2022-10-15 17:49:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:10,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:10,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:10,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:10,099 INFO L87 Difference]: Start difference. First operand 428 states and 675 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:10,228 INFO L93 Difference]: Finished difference Result 705 states and 1129 transitions. [2022-10-15 17:49:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:10,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-10-15 17:49:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:10,235 INFO L225 Difference]: With dead ends: 705 [2022-10-15 17:49:10,236 INFO L226 Difference]: Without dead ends: 705 [2022-10-15 17:49:10,236 INFO L412 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 [2022-10-15 17:49:10,239 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 319 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:10,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1014 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-10-15 17:49:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 692. [2022-10-15 17:49:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 685 states have (on average 1.6233576642335767) internal successors, (1112), 690 states have internal predecessors, (1112), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1117 transitions. [2022-10-15 17:49:10,287 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1117 transitions. Word has length 30 [2022-10-15 17:49:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:10,288 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1117 transitions. [2022-10-15 17:49:10,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1117 transitions. [2022-10-15 17:49:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 17:49:10,291 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:10,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:10,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:49:10,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:10,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1322875853, now seen corresponding path program 1 times [2022-10-15 17:49:10,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:10,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305047163] [2022-10-15 17:49:10,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:10,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:10,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:10,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305047163] [2022-10-15 17:49:10,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305047163] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:10,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:10,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855995140] [2022-10-15 17:49:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:10,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:10,400 INFO L87 Difference]: Start difference. First operand 692 states and 1117 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:10,420 INFO L93 Difference]: Finished difference Result 681 states and 1100 transitions. [2022-10-15 17:49:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:10,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-10-15 17:49:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:10,427 INFO L225 Difference]: With dead ends: 681 [2022-10-15 17:49:10,428 INFO L226 Difference]: Without dead ends: 681 [2022-10-15 17:49:10,428 INFO L412 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 [2022-10-15 17:49:10,430 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 442 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:10,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 443 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-10-15 17:49:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2022-10-15 17:49:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 674 states have (on average 1.6246290801186944) internal successors, (1095), 679 states have internal predecessors, (1095), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1100 transitions. [2022-10-15 17:49:10,472 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1100 transitions. Word has length 30 [2022-10-15 17:49:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:10,473 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 1100 transitions. [2022-10-15 17:49:10,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1100 transitions. [2022-10-15 17:49:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 17:49:10,485 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:10,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:10,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:49:10,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash -111057168, now seen corresponding path program 1 times [2022-10-15 17:49:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:10,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883408061] [2022-10-15 17:49:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:10,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:10,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883408061] [2022-10-15 17:49:10,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883408061] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:10,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:10,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598083880] [2022-10-15 17:49:10,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:10,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:10,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:10,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:10,584 INFO L87 Difference]: Start difference. First operand 681 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:10,622 INFO L93 Difference]: Finished difference Result 1076 states and 1724 transitions. [2022-10-15 17:49:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:10,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-10-15 17:49:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:10,630 INFO L225 Difference]: With dead ends: 1076 [2022-10-15 17:49:10,631 INFO L226 Difference]: Without dead ends: 1076 [2022-10-15 17:49:10,631 INFO L412 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 [2022-10-15 17:49:10,633 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 347 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:10,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 810 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-10-15 17:49:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2022-10-15 17:49:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1055 states have (on average 1.6180094786729857) internal successors, (1707), 1060 states have internal predecessors, (1707), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1712 transitions. [2022-10-15 17:49:10,672 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1712 transitions. Word has length 38 [2022-10-15 17:49:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:10,672 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1712 transitions. [2022-10-15 17:49:10,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1712 transitions. [2022-10-15 17:49:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 17:49:10,675 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:10,675 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:10,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:49:10,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1588300296, now seen corresponding path program 1 times [2022-10-15 17:49:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:10,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565075920] [2022-10-15 17:49:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:10,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565075920] [2022-10-15 17:49:10,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565075920] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:10,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:10,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:10,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051364965] [2022-10-15 17:49:10,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:10,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:10,767 INFO L87 Difference]: Start difference. First operand 1062 states and 1712 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:10,848 INFO L93 Difference]: Finished difference Result 1685 states and 2745 transitions. [2022-10-15 17:49:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:10,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-10-15 17:49:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:10,860 INFO L225 Difference]: With dead ends: 1685 [2022-10-15 17:49:10,860 INFO L226 Difference]: Without dead ends: 1685 [2022-10-15 17:49:10,861 INFO L412 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 [2022-10-15 17:49:10,863 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 391 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:10,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1117 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2022-10-15 17:49:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1068. [2022-10-15 17:49:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1061 states have (on average 1.6116870876531575) internal successors, (1710), 1066 states have internal predecessors, (1710), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1715 transitions. [2022-10-15 17:49:10,911 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1715 transitions. Word has length 43 [2022-10-15 17:49:10,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:10,912 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 1715 transitions. [2022-10-15 17:49:10,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1715 transitions. [2022-10-15 17:49:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 17:49:10,914 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:10,914 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:10,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:49:10,915 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1254718276, now seen corresponding path program 1 times [2022-10-15 17:49:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347748510] [2022-10-15 17:49:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:11,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347748510] [2022-10-15 17:49:11,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347748510] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:11,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:11,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:49:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746243449] [2022-10-15 17:49:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:11,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:49:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:11,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:49:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:49:11,030 INFO L87 Difference]: Start difference. First operand 1068 states and 1715 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:11,434 INFO L93 Difference]: Finished difference Result 1630 states and 2637 transitions. [2022-10-15 17:49:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:49:11,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-10-15 17:49:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:11,446 INFO L225 Difference]: With dead ends: 1630 [2022-10-15 17:49:11,446 INFO L226 Difference]: Without dead ends: 1630 [2022-10-15 17:49:11,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:11,454 INFO L413 NwaCegarLoop]: 714 mSDtfsCounter, 515 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:11,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1559 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:49:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2022-10-15 17:49:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1448. [2022-10-15 17:49:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1441 states have (on average 1.6162387231089521) internal successors, (2329), 1446 states have internal predecessors, (2329), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2334 transitions. [2022-10-15 17:49:11,517 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2334 transitions. Word has length 44 [2022-10-15 17:49:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:11,520 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 2334 transitions. [2022-10-15 17:49:11,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2334 transitions. [2022-10-15 17:49:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-10-15 17:49:11,521 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:11,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:11,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:49:11,522 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:11,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1086799808, now seen corresponding path program 1 times [2022-10-15 17:49:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:11,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813890426] [2022-10-15 17:49:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:11,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813890426] [2022-10-15 17:49:11,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813890426] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:11,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:11,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:49:11,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492925716] [2022-10-15 17:49:11,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:11,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:49:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:11,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:49:11,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:49:11,645 INFO L87 Difference]: Start difference. First operand 1448 states and 2334 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:12,077 INFO L93 Difference]: Finished difference Result 2897 states and 4470 transitions. [2022-10-15 17:49:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:49:12,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-10-15 17:49:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:12,096 INFO L225 Difference]: With dead ends: 2897 [2022-10-15 17:49:12,096 INFO L226 Difference]: Without dead ends: 2897 [2022-10-15 17:49:12,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:12,098 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 658 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:12,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1076 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:49:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2022-10-15 17:49:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2569. [2022-10-15 17:49:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2562 states have (on average 1.5874316939890711) internal successors, (4067), 2567 states have internal predecessors, (4067), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4072 transitions. [2022-10-15 17:49:12,199 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4072 transitions. Word has length 53 [2022-10-15 17:49:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:12,200 INFO L495 AbstractCegarLoop]: Abstraction has 2569 states and 4072 transitions. [2022-10-15 17:49:12,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4072 transitions. [2022-10-15 17:49:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-10-15 17:49:12,202 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:12,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:12,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:49:12,203 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1057984329, now seen corresponding path program 1 times [2022-10-15 17:49:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:12,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505841234] [2022-10-15 17:49:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:12,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505841234] [2022-10-15 17:49:12,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505841234] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:12,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:12,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:12,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975357995] [2022-10-15 17:49:12,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:12,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:12,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:12,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:12,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:12,272 INFO L87 Difference]: Start difference. First operand 2569 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:12,344 INFO L93 Difference]: Finished difference Result 2970 states and 4731 transitions. [2022-10-15 17:49:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-10-15 17:49:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:12,364 INFO L225 Difference]: With dead ends: 2970 [2022-10-15 17:49:12,364 INFO L226 Difference]: Without dead ends: 2970 [2022-10-15 17:49:12,365 INFO L412 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 [2022-10-15 17:49:12,366 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 362 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:12,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2022-10-15 17:49:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 2628. [2022-10-15 17:49:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2621 states have (on average 1.5986264784433422) internal successors, (4190), 2626 states have internal predecessors, (4190), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 4195 transitions. [2022-10-15 17:49:12,470 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 4195 transitions. Word has length 53 [2022-10-15 17:49:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:12,471 INFO L495 AbstractCegarLoop]: Abstraction has 2628 states and 4195 transitions. [2022-10-15 17:49:12,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 4195 transitions. [2022-10-15 17:49:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 17:49:12,474 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:12,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:12,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:49:12,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash -773409758, now seen corresponding path program 1 times [2022-10-15 17:49:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:12,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139737426] [2022-10-15 17:49:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:12,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139737426] [2022-10-15 17:49:12,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139737426] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:12,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:12,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532093752] [2022-10-15 17:49:12,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:12,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:12,636 INFO L87 Difference]: Start difference. First operand 2628 states and 4195 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:12,906 INFO L93 Difference]: Finished difference Result 4104 states and 6125 transitions. [2022-10-15 17:49:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:12,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-10-15 17:49:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:12,933 INFO L225 Difference]: With dead ends: 4104 [2022-10-15 17:49:12,933 INFO L226 Difference]: Without dead ends: 4104 [2022-10-15 17:49:12,933 INFO L412 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 [2022-10-15 17:49:12,934 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 247 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:12,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 842 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2022-10-15 17:49:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 3380. [2022-10-15 17:49:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3373 states have (on average 1.51586125111177) internal successors, (5113), 3378 states have internal predecessors, (5113), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 5118 transitions. [2022-10-15 17:49:13,065 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 5118 transitions. Word has length 58 [2022-10-15 17:49:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:13,065 INFO L495 AbstractCegarLoop]: Abstraction has 3380 states and 5118 transitions. [2022-10-15 17:49:13,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 5118 transitions. [2022-10-15 17:49:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 17:49:13,067 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:13,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:13,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:49:13,068 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash 366292214, now seen corresponding path program 1 times [2022-10-15 17:49:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:13,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066790770] [2022-10-15 17:49:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:13,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:13,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066790770] [2022-10-15 17:49:13,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066790770] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:13,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:13,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557125509] [2022-10-15 17:49:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:13,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:13,152 INFO L87 Difference]: Start difference. First operand 3380 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:13,254 INFO L93 Difference]: Finished difference Result 3306 states and 4908 transitions. [2022-10-15 17:49:13,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:13,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-10-15 17:49:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:13,274 INFO L225 Difference]: With dead ends: 3306 [2022-10-15 17:49:13,275 INFO L226 Difference]: Without dead ends: 3306 [2022-10-15 17:49:13,276 INFO L412 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 [2022-10-15 17:49:13,277 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 339 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:13,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 437 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2022-10-15 17:49:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3306. [2022-10-15 17:49:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3306 states, 3299 states have (on average 1.4862079418005456) internal successors, (4903), 3304 states have internal predecessors, (4903), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4908 transitions. [2022-10-15 17:49:13,389 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4908 transitions. Word has length 60 [2022-10-15 17:49:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:13,391 INFO L495 AbstractCegarLoop]: Abstraction has 3306 states and 4908 transitions. [2022-10-15 17:49:13,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4908 transitions. [2022-10-15 17:49:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 17:49:13,393 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:13,393 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:13,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:49:13,394 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1041241357, now seen corresponding path program 1 times [2022-10-15 17:49:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:13,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960436675] [2022-10-15 17:49:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:13,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960436675] [2022-10-15 17:49:13,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960436675] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:13,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:13,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293604270] [2022-10-15 17:49:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:13,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:13,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:13,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:13,478 INFO L87 Difference]: Start difference. First operand 3306 states and 4908 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:13,568 INFO L93 Difference]: Finished difference Result 5713 states and 8301 transitions. [2022-10-15 17:49:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-10-15 17:49:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:13,602 INFO L225 Difference]: With dead ends: 5713 [2022-10-15 17:49:13,602 INFO L226 Difference]: Without dead ends: 5713 [2022-10-15 17:49:13,603 INFO L412 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 [2022-10-15 17:49:13,604 INFO L413 NwaCegarLoop]: 642 mSDtfsCounter, 315 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:13,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1032 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5713 states. [2022-10-15 17:49:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5713 to 5221. [2022-10-15 17:49:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5221 states, 5214 states have (on average 1.4485999232834676) internal successors, (7553), 5219 states have internal predecessors, (7553), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5221 states to 5221 states and 7558 transitions. [2022-10-15 17:49:13,777 INFO L78 Accepts]: Start accepts. Automaton has 5221 states and 7558 transitions. Word has length 60 [2022-10-15 17:49:13,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:13,777 INFO L495 AbstractCegarLoop]: Abstraction has 5221 states and 7558 transitions. [2022-10-15 17:49:13,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5221 states and 7558 transitions. [2022-10-15 17:49:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 17:49:13,779 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:13,780 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:13,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:49:13,780 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash 219675893, now seen corresponding path program 1 times [2022-10-15 17:49:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:13,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557667189] [2022-10-15 17:49:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:49:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:13,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557667189] [2022-10-15 17:49:13,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557667189] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:13,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:13,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409192025] [2022-10-15 17:49:13,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:13,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:13,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:13,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:13,827 INFO L87 Difference]: Start difference. First operand 5221 states and 7558 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:13,891 INFO L93 Difference]: Finished difference Result 5204 states and 7536 transitions. [2022-10-15 17:49:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:13,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 [2022-10-15 17:49:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:13,909 INFO L225 Difference]: With dead ends: 5204 [2022-10-15 17:49:13,910 INFO L226 Difference]: Without dead ends: 5204 [2022-10-15 17:49:13,910 INFO L412 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 [2022-10-15 17:49:13,911 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 421 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:13,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 423 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2022-10-15 17:49:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 5204. [2022-10-15 17:49:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5204 states, 5197 states have (on average 1.4491052530305946) internal successors, (7531), 5202 states have internal predecessors, (7531), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5204 states to 5204 states and 7536 transitions. [2022-10-15 17:49:14,077 INFO L78 Accepts]: Start accepts. Automaton has 5204 states and 7536 transitions. Word has length 60 [2022-10-15 17:49:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:14,077 INFO L495 AbstractCegarLoop]: Abstraction has 5204 states and 7536 transitions. [2022-10-15 17:49:14,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5204 states and 7536 transitions. [2022-10-15 17:49:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-15 17:49:14,080 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:14,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:14,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:49:14,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:14,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1990581977, now seen corresponding path program 1 times [2022-10-15 17:49:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:14,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492601413] [2022-10-15 17:49:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:14,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:14,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492601413] [2022-10-15 17:49:14,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492601413] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:14,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:14,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964671203] [2022-10-15 17:49:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:14,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:14,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:14,237 INFO L87 Difference]: Start difference. First operand 5204 states and 7536 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:15,107 INFO L93 Difference]: Finished difference Result 20254 states and 28862 transitions. [2022-10-15 17:49:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 17:49:15,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-10-15 17:49:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:15,170 INFO L225 Difference]: With dead ends: 20254 [2022-10-15 17:49:15,170 INFO L226 Difference]: Without dead ends: 20254 [2022-10-15 17:49:15,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-10-15 17:49:15,172 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 2074 mSDsluCounter, 2894 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2074 SdHoareTripleChecker+Valid, 3944 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:15,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2074 Valid, 3944 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 17:49:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20254 states. [2022-10-15 17:49:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20254 to 6558. [2022-10-15 17:49:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6551 states have (on average 1.4443596397496565) internal successors, (9462), 6556 states have internal predecessors, (9462), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 9467 transitions. [2022-10-15 17:49:15,468 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 9467 transitions. Word has length 63 [2022-10-15 17:49:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:15,468 INFO L495 AbstractCegarLoop]: Abstraction has 6558 states and 9467 transitions. [2022-10-15 17:49:15,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 9467 transitions. [2022-10-15 17:49:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-15 17:49:15,471 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:15,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:15,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 17:49:15,472 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1589623507, now seen corresponding path program 1 times [2022-10-15 17:49:15,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:15,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344710526] [2022-10-15 17:49:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:15,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344710526] [2022-10-15 17:49:15,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344710526] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:15,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:15,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:49:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294673514] [2022-10-15 17:49:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:15,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:49:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:49:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:15,648 INFO L87 Difference]: Start difference. First operand 6558 states and 9467 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:16,582 INFO L93 Difference]: Finished difference Result 39055 states and 55716 transitions. [2022-10-15 17:49:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-15 17:49:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-10-15 17:49:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:16,803 INFO L225 Difference]: With dead ends: 39055 [2022-10-15 17:49:16,803 INFO L226 Difference]: Without dead ends: 39055 [2022-10-15 17:49:16,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:49:16,805 INFO L413 NwaCegarLoop]: 1847 mSDtfsCounter, 3845 mSDsluCounter, 6702 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3845 SdHoareTripleChecker+Valid, 8549 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:16,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3845 Valid, 8549 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:49:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39055 states. [2022-10-15 17:49:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39055 to 6984. [2022-10-15 17:49:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6984 states, 6977 states have (on average 1.437437293965888) internal successors, (10029), 6982 states have internal predecessors, (10029), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6984 states to 6984 states and 10034 transitions. [2022-10-15 17:49:17,440 INFO L78 Accepts]: Start accepts. Automaton has 6984 states and 10034 transitions. Word has length 64 [2022-10-15 17:49:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:17,440 INFO L495 AbstractCegarLoop]: Abstraction has 6984 states and 10034 transitions. [2022-10-15 17:49:17,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6984 states and 10034 transitions. [2022-10-15 17:49:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 17:49:17,444 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:17,444 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:17,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 17:49:17,444 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash -590939824, now seen corresponding path program 1 times [2022-10-15 17:49:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:17,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697096225] [2022-10-15 17:49:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:17,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697096225] [2022-10-15 17:49:17,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697096225] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:17,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:17,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:49:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844277837] [2022-10-15 17:49:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:17,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:49:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:17,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:49:17,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:49:17,534 INFO L87 Difference]: Start difference. First operand 6984 states and 10034 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:17,804 INFO L93 Difference]: Finished difference Result 7171 states and 10212 transitions. [2022-10-15 17:49:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:49:17,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-10-15 17:49:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:17,827 INFO L225 Difference]: With dead ends: 7171 [2022-10-15 17:49:17,828 INFO L226 Difference]: Without dead ends: 7171 [2022-10-15 17:49:17,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:17,832 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 567 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:17,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1176 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7171 states. [2022-10-15 17:49:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7171 to 6984. [2022-10-15 17:49:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6984 states, 6977 states have (on average 1.4322774831589509) internal successors, (9993), 6982 states have internal predecessors, (9993), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6984 states to 6984 states and 9998 transitions. [2022-10-15 17:49:17,995 INFO L78 Accepts]: Start accepts. Automaton has 6984 states and 9998 transitions. Word has length 67 [2022-10-15 17:49:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:17,996 INFO L495 AbstractCegarLoop]: Abstraction has 6984 states and 9998 transitions. [2022-10-15 17:49:17,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 6984 states and 9998 transitions. [2022-10-15 17:49:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-15 17:49:17,998 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:17,999 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:17,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 17:49:17,999 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:18,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1232309617, now seen corresponding path program 1 times [2022-10-15 17:49:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:18,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879683744] [2022-10-15 17:49:18,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:18,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:18,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879683744] [2022-10-15 17:49:18,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879683744] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:18,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:18,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465008021] [2022-10-15 17:49:18,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:18,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:18,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:18,138 INFO L87 Difference]: Start difference. First operand 6984 states and 9998 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:18,241 INFO L93 Difference]: Finished difference Result 7033 states and 9720 transitions. [2022-10-15 17:49:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:18,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-10-15 17:49:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:18,262 INFO L225 Difference]: With dead ends: 7033 [2022-10-15 17:49:18,262 INFO L226 Difference]: Without dead ends: 7033 [2022-10-15 17:49:18,263 INFO L412 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 [2022-10-15 17:49:18,264 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 344 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:18,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 836 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2022-10-15 17:49:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 6969. [2022-10-15 17:49:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6969 states, 6962 states have (on average 1.386526860097673) internal successors, (9653), 6967 states have internal predecessors, (9653), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 9658 transitions. [2022-10-15 17:49:18,419 INFO L78 Accepts]: Start accepts. Automaton has 6969 states and 9658 transitions. Word has length 72 [2022-10-15 17:49:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:18,420 INFO L495 AbstractCegarLoop]: Abstraction has 6969 states and 9658 transitions. [2022-10-15 17:49:18,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6969 states and 9658 transitions. [2022-10-15 17:49:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-15 17:49:18,422 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:18,422 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:18,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 17:49:18,423 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:18,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1344165400, now seen corresponding path program 1 times [2022-10-15 17:49:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:18,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422704527] [2022-10-15 17:49:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 17:49:18,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:18,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422704527] [2022-10-15 17:49:18,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422704527] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:18,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:18,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683176208] [2022-10-15 17:49:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:18,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:18,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:18,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:18,481 INFO L87 Difference]: Start difference. First operand 6969 states and 9658 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:18,562 INFO L93 Difference]: Finished difference Result 7813 states and 10691 transitions. [2022-10-15 17:49:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:18,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 74 [2022-10-15 17:49:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:18,585 INFO L225 Difference]: With dead ends: 7813 [2022-10-15 17:49:18,585 INFO L226 Difference]: Without dead ends: 7741 [2022-10-15 17:49:18,585 INFO L412 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 [2022-10-15 17:49:18,586 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 327 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:18,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 855 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2022-10-15 17:49:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 7200. [2022-10-15 17:49:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 7193 states have (on average 1.384123453357431) internal successors, (9956), 7198 states have internal predecessors, (9956), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9961 transitions. [2022-10-15 17:49:18,806 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9961 transitions. Word has length 74 [2022-10-15 17:49:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:18,807 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9961 transitions. [2022-10-15 17:49:18,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9961 transitions. [2022-10-15 17:49:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-15 17:49:18,809 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:18,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:18,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 17:49:18,810 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:18,810 INFO L85 PathProgramCache]: Analyzing trace with hash -324736246, now seen corresponding path program 1 times [2022-10-15 17:49:18,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:18,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254428263] [2022-10-15 17:49:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:18,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:18,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254428263] [2022-10-15 17:49:18,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254428263] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:18,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:18,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:18,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267027363] [2022-10-15 17:49:18,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:18,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:18,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:18,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:18,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:18,890 INFO L87 Difference]: Start difference. First operand 7200 states and 9961 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:18,944 INFO L93 Difference]: Finished difference Result 3622 states and 4852 transitions. [2022-10-15 17:49:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:18,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-10-15 17:49:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:18,954 INFO L225 Difference]: With dead ends: 3622 [2022-10-15 17:49:18,954 INFO L226 Difference]: Without dead ends: 3622 [2022-10-15 17:49:18,955 INFO L412 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 [2022-10-15 17:49:18,956 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 69 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:18,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 714 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2022-10-15 17:49:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3607. [2022-10-15 17:49:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3600 states have (on average 1.3422222222222222) internal successors, (4832), 3605 states have internal predecessors, (4832), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 4837 transitions. [2022-10-15 17:49:19,034 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 4837 transitions. Word has length 79 [2022-10-15 17:49:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:19,035 INFO L495 AbstractCegarLoop]: Abstraction has 3607 states and 4837 transitions. [2022-10-15 17:49:19,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 4837 transitions. [2022-10-15 17:49:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-15 17:49:19,037 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:19,037 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:19,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 17:49:19,038 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:19,039 INFO L85 PathProgramCache]: Analyzing trace with hash 202266748, now seen corresponding path program 1 times [2022-10-15 17:49:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:19,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145141162] [2022-10-15 17:49:19,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:19,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:19,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:19,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145141162] [2022-10-15 17:49:19,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145141162] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:19,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:19,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:49:19,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905253775] [2022-10-15 17:49:19,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:19,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:19,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:19,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:19,183 INFO L87 Difference]: Start difference. First operand 3607 states and 4837 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:19,387 INFO L93 Difference]: Finished difference Result 11578 states and 15560 transitions. [2022-10-15 17:49:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:49:19,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-10-15 17:49:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:19,421 INFO L225 Difference]: With dead ends: 11578 [2022-10-15 17:49:19,421 INFO L226 Difference]: Without dead ends: 11578 [2022-10-15 17:49:19,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:19,426 INFO L413 NwaCegarLoop]: 1036 mSDtfsCounter, 1568 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:19,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 3313 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11578 states. [2022-10-15 17:49:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11578 to 3611. [2022-10-15 17:49:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 3604 states have (on average 1.3390677025527191) internal successors, (4826), 3609 states have internal predecessors, (4826), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 4831 transitions. [2022-10-15 17:49:19,655 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 4831 transitions. Word has length 97 [2022-10-15 17:49:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:19,656 INFO L495 AbstractCegarLoop]: Abstraction has 3611 states and 4831 transitions. [2022-10-15 17:49:19,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 4831 transitions. [2022-10-15 17:49:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-10-15 17:49:19,663 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:19,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:19,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 17:49:19,664 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash -736321929, now seen corresponding path program 1 times [2022-10-15 17:49:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:19,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50598795] [2022-10-15 17:49:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:19,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50598795] [2022-10-15 17:49:19,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50598795] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:19,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:19,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547964812] [2022-10-15 17:49:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:19,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:19,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:19,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:19,752 INFO L87 Difference]: Start difference. First operand 3611 states and 4831 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:19,791 INFO L93 Difference]: Finished difference Result 3583 states and 4788 transitions. [2022-10-15 17:49:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:19,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-10-15 17:49:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:19,801 INFO L225 Difference]: With dead ends: 3583 [2022-10-15 17:49:19,801 INFO L226 Difference]: Without dead ends: 3583 [2022-10-15 17:49:19,802 INFO L412 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 [2022-10-15 17:49:19,803 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 24 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:19,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 707 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2022-10-15 17:49:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3426. [2022-10-15 17:49:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 3419 states have (on average 1.349809885931559) internal successors, (4615), 3424 states have internal predecessors, (4615), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 4620 transitions. [2022-10-15 17:49:19,909 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 4620 transitions. Word has length 99 [2022-10-15 17:49:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:19,909 INFO L495 AbstractCegarLoop]: Abstraction has 3426 states and 4620 transitions. [2022-10-15 17:49:19,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 4620 transitions. [2022-10-15 17:49:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-15 17:49:19,914 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:19,915 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:19,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 17:49:19,917 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash 132089037, now seen corresponding path program 1 times [2022-10-15 17:49:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:19,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902022137] [2022-10-15 17:49:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:20,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902022137] [2022-10-15 17:49:20,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902022137] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:20,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275291933] [2022-10-15 17:49:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:20,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:20,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:49:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:20,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:49:20,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:20,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275291933] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:20,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:20,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 17:49:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934390731] [2022-10-15 17:49:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:20,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:20,585 INFO L87 Difference]: Start difference. First operand 3426 states and 4620 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:20,676 INFO L93 Difference]: Finished difference Result 4050 states and 5387 transitions. [2022-10-15 17:49:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:20,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-10-15 17:49:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:20,689 INFO L225 Difference]: With dead ends: 4050 [2022-10-15 17:49:20,690 INFO L226 Difference]: Without dead ends: 4050 [2022-10-15 17:49:20,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:20,691 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 223 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:20,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 762 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2022-10-15 17:49:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3930. [2022-10-15 17:49:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3930 states, 3923 states have (on average 1.338771348457813) internal successors, (5252), 3928 states have internal predecessors, (5252), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 5257 transitions. [2022-10-15 17:49:20,794 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 5257 transitions. Word has length 103 [2022-10-15 17:49:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:20,795 INFO L495 AbstractCegarLoop]: Abstraction has 3930 states and 5257 transitions. [2022-10-15 17:49:20,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 5257 transitions. [2022-10-15 17:49:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-10-15 17:49:20,798 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:20,799 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:20,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 17:49:21,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-10-15 17:49:21,015 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1814286243, now seen corresponding path program 1 times [2022-10-15 17:49:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:21,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122210301] [2022-10-15 17:49:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:21,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:21,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122210301] [2022-10-15 17:49:21,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122210301] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:21,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:21,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:49:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595864236] [2022-10-15 17:49:21,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:21,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:49:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:21,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:49:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:49:21,197 INFO L87 Difference]: Start difference. First operand 3930 states and 5257 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:21,438 INFO L93 Difference]: Finished difference Result 3725 states and 4940 transitions. [2022-10-15 17:49:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:49:21,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-10-15 17:49:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:21,446 INFO L225 Difference]: With dead ends: 3725 [2022-10-15 17:49:21,446 INFO L226 Difference]: Without dead ends: 3725 [2022-10-15 17:49:21,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:21,447 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 266 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:21,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1192 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2022-10-15 17:49:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3651. [2022-10-15 17:49:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3644 states have (on average 1.3323271130625687) internal successors, (4855), 3649 states have internal predecessors, (4855), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4860 transitions. [2022-10-15 17:49:21,524 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4860 transitions. Word has length 110 [2022-10-15 17:49:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:21,524 INFO L495 AbstractCegarLoop]: Abstraction has 3651 states and 4860 transitions. [2022-10-15 17:49:21,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4860 transitions. [2022-10-15 17:49:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-10-15 17:49:21,529 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:21,529 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:21,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-15 17:49:21,530 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:21,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1058359781, now seen corresponding path program 1 times [2022-10-15 17:49:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:21,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038732825] [2022-10-15 17:49:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:21,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038732825] [2022-10-15 17:49:21,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038732825] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:21,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616425047] [2022-10-15 17:49:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:21,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:21,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:49:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:21,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:49:21,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:21,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616425047] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:21,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:21,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 17:49:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641006903] [2022-10-15 17:49:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:21,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:21,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:21,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:21,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:21,972 INFO L87 Difference]: Start difference. First operand 3651 states and 4860 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:22,007 INFO L93 Difference]: Finished difference Result 2324 states and 3031 transitions. [2022-10-15 17:49:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2022-10-15 17:49:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:22,012 INFO L225 Difference]: With dead ends: 2324 [2022-10-15 17:49:22,012 INFO L226 Difference]: Without dead ends: 2324 [2022-10-15 17:49:22,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:22,013 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 258 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:22,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 412 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:22,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2022-10-15 17:49:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2324. [2022-10-15 17:49:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2317 states have (on average 1.3059991368148467) internal successors, (3026), 2322 states have internal predecessors, (3026), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3031 transitions. [2022-10-15 17:49:22,057 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3031 transitions. Word has length 156 [2022-10-15 17:49:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:22,058 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3031 transitions. [2022-10-15 17:49:22,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3031 transitions. [2022-10-15 17:49:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-10-15 17:49:22,061 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:22,062 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:22,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:22,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-10-15 17:49:22,277 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2074091893, now seen corresponding path program 1 times [2022-10-15 17:49:22,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:22,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775524577] [2022-10-15 17:49:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 17:49:22,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:22,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775524577] [2022-10-15 17:49:22,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775524577] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:22,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:22,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:49:22,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315339453] [2022-10-15 17:49:22,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:22,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:22,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:22,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:22,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:22,401 INFO L87 Difference]: Start difference. First operand 2324 states and 3031 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:22,517 INFO L93 Difference]: Finished difference Result 620 states and 677 transitions. [2022-10-15 17:49:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-10-15 17:49:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:22,520 INFO L225 Difference]: With dead ends: 620 [2022-10-15 17:49:22,521 INFO L226 Difference]: Without dead ends: 620 [2022-10-15 17:49:22,521 INFO L412 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 [2022-10-15 17:49:22,525 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 133 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:22,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 356 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-10-15 17:49:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 577. [2022-10-15 17:49:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 572 states have (on average 1.097902097902098) internal successors, (628), 575 states have internal predecessors, (628), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 631 transitions. [2022-10-15 17:49:22,540 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 631 transitions. Word has length 159 [2022-10-15 17:49:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:22,540 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 631 transitions. [2022-10-15 17:49:22,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 631 transitions. [2022-10-15 17:49:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-10-15 17:49:22,543 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:22,543 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:22,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-15 17:49:22,544 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1142739565, now seen corresponding path program 1 times [2022-10-15 17:49:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:22,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126583991] [2022-10-15 17:49:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:49:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:22,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126583991] [2022-10-15 17:49:22,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126583991] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:22,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506717755] [2022-10-15 17:49:22,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:22,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:22,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:22,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:22,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:49:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 17:49:22,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:49:23,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:23,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506717755] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:23,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:23,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 17:49:23,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829480180] [2022-10-15 17:49:23,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:23,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:23,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:23,224 INFO L87 Difference]: Start difference. First operand 577 states and 631 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:23,279 INFO L93 Difference]: Finished difference Result 563 states and 619 transitions. [2022-10-15 17:49:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:49:23,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2022-10-15 17:49:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:23,281 INFO L225 Difference]: With dead ends: 563 [2022-10-15 17:49:23,281 INFO L226 Difference]: Without dead ends: 563 [2022-10-15 17:49:23,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:23,283 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 389 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:23,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 475 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-10-15 17:49:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 504. [2022-10-15 17:49:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.094188376753507) internal successors, (546), 502 states have internal predecessors, (546), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 549 transitions. [2022-10-15 17:49:23,300 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 549 transitions. Word has length 162 [2022-10-15 17:49:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:23,300 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 549 transitions. [2022-10-15 17:49:23,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 549 transitions. [2022-10-15 17:49:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-10-15 17:49:23,304 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:23,304 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:23,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:23,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:23,518 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1273263244, now seen corresponding path program 1 times [2022-10-15 17:49:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:23,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173675062] [2022-10-15 17:49:23,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 17:49:23,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173675062] [2022-10-15 17:49:23,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173675062] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:23,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:23,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:49:23,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026523481] [2022-10-15 17:49:23,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:23,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:49:23,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:23,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:49:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:23,830 INFO L87 Difference]: Start difference. First operand 504 states and 549 transitions. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:24,064 INFO L93 Difference]: Finished difference Result 1267 states and 1400 transitions. [2022-10-15 17:49:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:49:24,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-10-15 17:49:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:24,068 INFO L225 Difference]: With dead ends: 1267 [2022-10-15 17:49:24,068 INFO L226 Difference]: Without dead ends: 1267 [2022-10-15 17:49:24,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:49:24,070 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 774 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:24,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1782 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-10-15 17:49:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 503. [2022-10-15 17:49:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 499 states have (on average 1.092184368737475) internal successors, (545), 501 states have internal predecessors, (545), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 547 transitions. [2022-10-15 17:49:24,089 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 547 transitions. Word has length 164 [2022-10-15 17:49:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:24,090 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 547 transitions. [2022-10-15 17:49:24,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 547 transitions. [2022-10-15 17:49:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-10-15 17:49:24,093 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:24,093 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:24,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-15 17:49:24,094 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 827579264, now seen corresponding path program 1 times [2022-10-15 17:49:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:24,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880888342] [2022-10-15 17:49:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 17:49:24,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:24,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880888342] [2022-10-15 17:49:24,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880888342] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:24,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:24,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:49:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771443536] [2022-10-15 17:49:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:24,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:24,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:24,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:24,312 INFO L87 Difference]: Start difference. First operand 503 states and 547 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:24,386 INFO L93 Difference]: Finished difference Result 745 states and 816 transitions. [2022-10-15 17:49:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:49:24,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-10-15 17:49:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:24,388 INFO L225 Difference]: With dead ends: 745 [2022-10-15 17:49:24,388 INFO L226 Difference]: Without dead ends: 745 [2022-10-15 17:49:24,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:24,390 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 407 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:24,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 848 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-10-15 17:49:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 499. [2022-10-15 17:49:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 496 states have (on average 1.0866935483870968) internal successors, (539), 497 states have internal predecessors, (539), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 540 transitions. [2022-10-15 17:49:24,402 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 540 transitions. Word has length 165 [2022-10-15 17:49:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:24,402 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 540 transitions. [2022-10-15 17:49:24,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 540 transitions. [2022-10-15 17:49:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-10-15 17:49:24,407 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:24,407 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:24,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-15 17:49:24,408 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 9027523, now seen corresponding path program 1 times [2022-10-15 17:49:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:24,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886632933] [2022-10-15 17:49:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:24,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:26,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:26,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886632933] [2022-10-15 17:49:26,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886632933] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:26,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560583629] [2022-10-15 17:49:26,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:26,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:26,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:26,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:49:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:26,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-15 17:49:26,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 12 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:27,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:49:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:27,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560583629] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:49:27,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:49:27,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 30 [2022-10-15 17:49:27,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863417833] [2022-10-15 17:49:27,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:49:27,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 17:49:27,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:27,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 17:49:27,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:49:27,842 INFO L87 Difference]: Start difference. First operand 499 states and 540 transitions. Second operand has 30 states, 30 states have (on average 12.233333333333333) internal successors, (367), 30 states have internal predecessors, (367), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:29,462 INFO L93 Difference]: Finished difference Result 1079 states and 1201 transitions. [2022-10-15 17:49:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-15 17:49:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 12.233333333333333) internal successors, (367), 30 states have internal predecessors, (367), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2022-10-15 17:49:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:29,465 INFO L225 Difference]: With dead ends: 1079 [2022-10-15 17:49:29,466 INFO L226 Difference]: Without dead ends: 1079 [2022-10-15 17:49:29,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 453 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=640, Invalid=3520, Unknown=0, NotChecked=0, Total=4160 [2022-10-15 17:49:29,470 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 4123 mSDsluCounter, 4871 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4123 SdHoareTripleChecker+Valid, 5194 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:29,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4123 Valid, 5194 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 17:49:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-10-15 17:49:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 496. [2022-10-15 17:49:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.082828282828283) internal successors, (536), 495 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 536 transitions. [2022-10-15 17:49:29,484 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 536 transitions. Word has length 225 [2022-10-15 17:49:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:29,485 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 536 transitions. [2022-10-15 17:49:29,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 12.233333333333333) internal successors, (367), 30 states have internal predecessors, (367), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 536 transitions. [2022-10-15 17:49:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-10-15 17:49:29,490 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:29,490 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:29,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:29,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-15 17:49:29,706 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:29,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1658039065, now seen corresponding path program 1 times [2022-10-15 17:49:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:29,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284691079] [2022-10-15 17:49:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-10-15 17:49:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:29,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284691079] [2022-10-15 17:49:29,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284691079] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:29,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:29,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:49:29,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939619805] [2022-10-15 17:49:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:29,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:29,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:29,917 INFO L87 Difference]: Start difference. First operand 496 states and 536 transitions. Second operand has 3 states, 2 states have (on average 101.5) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:29,923 INFO L93 Difference]: Finished difference Result 495 states and 535 transitions. [2022-10-15 17:49:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 101.5) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 246 [2022-10-15 17:49:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:29,925 INFO L225 Difference]: With dead ends: 495 [2022-10-15 17:49:29,925 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:49:29,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:49:29,927 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 210 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 [2022-10-15 17:49:29,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:49:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:49:29,928 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) [2022-10-15 17:49:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:49:29,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2022-10-15 17:49:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:29,929 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:49:29,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 101.5) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:49:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:49:29,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:49:29,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:49:29,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:49:29,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-10-15 17:49:29,946 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:29,949 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:49:29,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:49:29 BoogieIcfgContainer [2022-10-15 17:49:29,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:49:29,958 INFO L158 Benchmark]: Toolchain (without parser) took 23858.86ms. Allocated memory was 152.0MB in the beginning and 521.1MB in the end (delta: 369.1MB). Free memory was 125.4MB in the beginning and 197.6MB in the end (delta: -72.2MB). Peak memory consumption was 297.9MB. Max. memory is 8.0GB. [2022-10-15 17:49:29,958 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 152.0MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:49:29,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.01ms. Allocated memory is still 152.0MB. Free memory was 125.2MB in the beginning and 105.2MB in the end (delta: 20.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-10-15 17:49:29,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.31ms. Allocated memory is still 152.0MB. Free memory was 105.0MB in the beginning and 101.7MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 17:49:29,959 INFO L158 Benchmark]: Boogie Preprocessor took 119.29ms. Allocated memory is still 152.0MB. Free memory was 101.5MB in the beginning and 98.2MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 17:49:29,962 INFO L158 Benchmark]: RCFGBuilder took 1532.46ms. Allocated memory is still 152.0MB. Free memory was 98.2MB in the beginning and 95.3MB in the end (delta: 2.9MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-10-15 17:49:29,964 INFO L158 Benchmark]: TraceAbstraction took 21281.96ms. Allocated memory was 152.0MB in the beginning and 521.1MB in the end (delta: 369.1MB). Free memory was 94.8MB in the beginning and 197.6MB in the end (delta: -102.8MB). Peak memory consumption was 265.7MB. Max. memory is 8.0GB. [2022-10-15 17:49:29,973 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 152.0MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 753.01ms. Allocated memory is still 152.0MB. Free memory was 125.2MB in the beginning and 105.2MB in the end (delta: 20.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 153.31ms. Allocated memory is still 152.0MB. Free memory was 105.0MB in the beginning and 101.7MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 119.29ms. Allocated memory is still 152.0MB. Free memory was 101.5MB in the beginning and 98.2MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1532.46ms. Allocated memory is still 152.0MB. Free memory was 98.2MB in the beginning and 95.3MB in the end (delta: 2.9MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * TraceAbstraction took 21281.96ms. Allocated memory was 152.0MB in the beginning and 521.1MB in the end (delta: 369.1MB). Free memory was 94.8MB in the beginning and 197.6MB in the end (delta: -102.8MB). Peak memory consumption was 265.7MB. Max. memory is 8.0GB. * 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: 1351]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 20]: 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 2 procedures, 272 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20011 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20011 mSDsluCounter, 41540 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26044 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3488 IncrementalHoareTripleChecker+Invalid, 4012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 15496 mSDtfsCounter, 3488 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1149 GetRequests, 968 SyntacticMatches, 5 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7200occurred in iteration=17, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 59315 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 3291 NumberOfCodeBlocks, 3291 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3482 ConstructedInterpolants, 0 QuantifiedInterpolants, 9391 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2155 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 414/599 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! [2022-10-15 17:49:30,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...