/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/bitvector/soft_float_1-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:32:02,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:32:02,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:32:02,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:32:02,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:32:02,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:32:02,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:32:02,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:32:02,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:32:02,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:32:02,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:32:02,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:32:02,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:32:02,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:32:02,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:32:02,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:32:02,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:32:02,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:32:02,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:32:02,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:32:02,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:32:02,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:32:02,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:32:02,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:32:02,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:32:02,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:32:02,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:32:02,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:32:02,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:32:02,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:32:02,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:32:02,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:32:02,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:32:02,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:32:02,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:32:02,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:32:02,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:32:02,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:32:02,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:32:02,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:32:02,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:32:02,279 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 16:32:02,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:32:02,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:32:02,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:32:02,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:32:02,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:32:02,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:32:02,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:32:02,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:32:02,311 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:32:02,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:32:02,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:32:02,312 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:32:02,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:32:02,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:32:02,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:32:02,313 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:32:02,314 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:32:02,314 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:32:02,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:32:02,314 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:32:02,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:32:02,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:32:02,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:32:02,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:32:02,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:32:02,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:32:02,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:32:02,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:32:02,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:32:02,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:32:02,317 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 16:32:02,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:32:02,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:32:02,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:32:02,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:32:02,740 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:32:02,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-10-15 16:32:02,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9580eafc/99fa66a401b2429da14604422f986efa/FLAGad40cf041 [2022-10-15 16:32:03,523 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:32:03,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-10-15 16:32:03,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9580eafc/99fa66a401b2429da14604422f986efa/FLAGad40cf041 [2022-10-15 16:32:03,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9580eafc/99fa66a401b2429da14604422f986efa [2022-10-15 16:32:03,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:32:03,869 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:32:03,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:32:03,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:32:03,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:32:03,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:32:03" (1/1) ... [2022-10-15 16:32:03,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3555378e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:03, skipping insertion in model container [2022-10-15 16:32:03,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:32:03" (1/1) ... [2022-10-15 16:32:03,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:32:03,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:32:04,184 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-10-15 16:32:04,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:32:04,300 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:32:04,319 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-10-15 16:32:04,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:32:04,386 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:32:04,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04 WrapperNode [2022-10-15 16:32:04,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:32:04,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:32:04,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:32:04,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:32:04,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,492 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 213 [2022-10-15 16:32:04,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:32:04,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:32:04,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:32:04,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:32:04,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,565 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:32:04,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:32:04,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:32:04,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:32:04,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (1/1) ... [2022-10-15 16:32:04,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:32:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:04,622 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 16:32:04,642 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 16:32:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:32:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:32:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-10-15 16:32:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-10-15 16:32:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:32:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:32:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-10-15 16:32:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-10-15 16:32:04,775 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:32:04,778 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:32:05,439 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:32:05,457 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:32:05,461 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:32:05,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:32:05 BoogieIcfgContainer [2022-10-15 16:32:05,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:32:05,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:32:05,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:32:05,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:32:05,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:32:03" (1/3) ... [2022-10-15 16:32:05,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b86fb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:32:05, skipping insertion in model container [2022-10-15 16:32:05,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:04" (2/3) ... [2022-10-15 16:32:05,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b86fb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:32:05, skipping insertion in model container [2022-10-15 16:32:05,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:32:05" (3/3) ... [2022-10-15 16:32:05,478 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-10-15 16:32:05,500 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:32:05,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 16:32:05,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:32:05,566 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;@6621522e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:32:05,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 16:32:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 93 states have (on average 1.7311827956989247) internal successors, (161), 97 states have internal predecessors, (161), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-10-15 16:32:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 16:32:05,585 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:05,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 16:32:05,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 435623152, now seen corresponding path program 1 times [2022-10-15 16:32:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:05,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421199495] [2022-10-15 16:32:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:05,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:05,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:06,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:06,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421199495] [2022-10-15 16:32:06,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421199495] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:06,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:06,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:32:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437191769] [2022-10-15 16:32:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:06,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:06,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:06,097 INFO L87 Difference]: Start difference. First operand has 107 states, 93 states have (on average 1.7311827956989247) internal successors, (161), 97 states have internal predecessors, (161), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:06,289 INFO L93 Difference]: Finished difference Result 114 states and 174 transitions. [2022-10-15 16:32:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-10-15 16:32:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:06,309 INFO L225 Difference]: With dead ends: 114 [2022-10-15 16:32:06,310 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 16:32:06,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:06,318 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 124 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:06,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 305 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 16:32:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2022-10-15 16:32:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 92 states have internal predecessors, (138), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 16:32:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2022-10-15 16:32:06,376 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 35 [2022-10-15 16:32:06,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:06,377 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2022-10-15 16:32:06,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2022-10-15 16:32:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 16:32:06,380 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:06,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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 16:32:06,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:32:06,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1052908692, now seen corresponding path program 1 times [2022-10-15 16:32:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:06,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279484104] [2022-10-15 16:32:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:06,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:06,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279484104] [2022-10-15 16:32:06,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279484104] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:06,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:06,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439646359] [2022-10-15 16:32:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:06,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:06,596 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:06,723 INFO L93 Difference]: Finished difference Result 165 states and 251 transitions. [2022-10-15 16:32:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-10-15 16:32:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:06,733 INFO L225 Difference]: With dead ends: 165 [2022-10-15 16:32:06,734 INFO L226 Difference]: Without dead ends: 165 [2022-10-15 16:32:06,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:06,741 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 106 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:06,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 449 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-10-15 16:32:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2022-10-15 16:32:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 132 states have (on average 1.5) internal successors, (198), 134 states have internal predecessors, (198), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:32:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2022-10-15 16:32:06,781 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 37 [2022-10-15 16:32:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:06,782 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2022-10-15 16:32:06,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2022-10-15 16:32:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:32:06,789 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:06,789 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 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 16:32:06,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:32:06,790 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1319850023, now seen corresponding path program 1 times [2022-10-15 16:32:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:06,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033892160] [2022-10-15 16:32:06,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:06,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:07,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033892160] [2022-10-15 16:32:07,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033892160] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:07,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:07,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365770334] [2022-10-15 16:32:07,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:07,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:07,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:07,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:07,022 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:07,099 INFO L93 Difference]: Finished difference Result 250 states and 375 transitions. [2022-10-15 16:32:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:07,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-10-15 16:32:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:07,102 INFO L225 Difference]: With dead ends: 250 [2022-10-15 16:32:07,102 INFO L226 Difference]: Without dead ends: 236 [2022-10-15 16:32:07,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:07,105 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 102 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:07,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 452 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-10-15 16:32:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 219. [2022-10-15 16:32:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 198 states have (on average 1.4595959595959596) internal successors, (289), 201 states have internal predecessors, (289), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-10-15 16:32:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2022-10-15 16:32:07,129 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 39 [2022-10-15 16:32:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:07,129 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2022-10-15 16:32:07,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2022-10-15 16:32:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:32:07,132 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:07,132 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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 16:32:07,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:32:07,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 43035220, now seen corresponding path program 1 times [2022-10-15 16:32:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:07,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159138835] [2022-10-15 16:32:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:07,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159138835] [2022-10-15 16:32:07,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159138835] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:07,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:07,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646644133] [2022-10-15 16:32:07,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:07,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:07,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:07,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:07,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:07,317 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:07,413 INFO L93 Difference]: Finished difference Result 335 states and 497 transitions. [2022-10-15 16:32:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-10-15 16:32:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:07,417 INFO L225 Difference]: With dead ends: 335 [2022-10-15 16:32:07,418 INFO L226 Difference]: Without dead ends: 321 [2022-10-15 16:32:07,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:07,420 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 206 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:07,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 685 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-10-15 16:32:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2022-10-15 16:32:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.4615384615384615) internal successors, (361), 251 states have internal predecessors, (361), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-10-15 16:32:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 405 transitions. [2022-10-15 16:32:07,442 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 405 transitions. Word has length 40 [2022-10-15 16:32:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:07,443 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 405 transitions. [2022-10-15 16:32:07,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 405 transitions. [2022-10-15 16:32:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:32:07,445 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:07,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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 16:32:07,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:32:07,446 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -978033134, now seen corresponding path program 1 times [2022-10-15 16:32:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874014846] [2022-10-15 16:32:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:07,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:07,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874014846] [2022-10-15 16:32:07,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874014846] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:07,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:07,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:07,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123915075] [2022-10-15 16:32:07,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:07,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:07,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:07,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:07,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:07,565 INFO L87 Difference]: Start difference. First operand 273 states and 405 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:07,618 INFO L93 Difference]: Finished difference Result 287 states and 428 transitions. [2022-10-15 16:32:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:07,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-10-15 16:32:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:07,626 INFO L225 Difference]: With dead ends: 287 [2022-10-15 16:32:07,626 INFO L226 Difference]: Without dead ends: 287 [2022-10-15 16:32:07,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:07,628 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 45 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:07,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 402 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-10-15 16:32:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2022-10-15 16:32:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 252 states have internal predecessors, (362), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-10-15 16:32:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 406 transitions. [2022-10-15 16:32:07,649 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 406 transitions. Word has length 40 [2022-10-15 16:32:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:07,649 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 406 transitions. [2022-10-15 16:32:07,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 406 transitions. [2022-10-15 16:32:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 16:32:07,651 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:07,652 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 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 16:32:07,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:32:07,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1854527884, now seen corresponding path program 1 times [2022-10-15 16:32:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:07,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347072485] [2022-10-15 16:32:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:07,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:07,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347072485] [2022-10-15 16:32:07,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347072485] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:07,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081935470] [2022-10-15 16:32:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:08,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:08,011 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 16:32:08,016 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 16:32:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-15 16:32:08,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:32:08,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:08,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081935470] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:08,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:08,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2022-10-15 16:32:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621342862] [2022-10-15 16:32:08,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:08,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-15 16:32:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:08,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-15 16:32:08,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:32:08,523 INFO L87 Difference]: Start difference. First operand 274 states and 406 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:32:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:09,537 INFO L93 Difference]: Finished difference Result 290 states and 441 transitions. [2022-10-15 16:32:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-15 16:32:09,538 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2022-10-15 16:32:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:09,541 INFO L225 Difference]: With dead ends: 290 [2022-10-15 16:32:09,541 INFO L226 Difference]: Without dead ends: 290 [2022-10-15 16:32:09,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:32:09,543 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 466 mSDsluCounter, 3017 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 3310 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:09,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 3310 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:32:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-10-15 16:32:09,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 173. [2022-10-15 16:32:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 156 states have internal predecessors, (220), 15 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (20), 15 states have call predecessors, (20), 14 states have call successors, (20) [2022-10-15 16:32:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2022-10-15 16:32:09,560 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 41 [2022-10-15 16:32:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:09,561 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2022-10-15 16:32:09,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:32:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2022-10-15 16:32:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 16:32:09,562 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:09,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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 16:32:09,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:09,779 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,SelfDestructingSolverStorable5 [2022-10-15 16:32:09,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1150666354, now seen corresponding path program 1 times [2022-10-15 16:32:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:09,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538616344] [2022-10-15 16:32:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:09,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538616344] [2022-10-15 16:32:09,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538616344] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:09,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:09,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410674017] [2022-10-15 16:32:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:09,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:09,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:09,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:09,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:09,868 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:09,935 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2022-10-15 16:32:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-10-15 16:32:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:09,938 INFO L225 Difference]: With dead ends: 179 [2022-10-15 16:32:09,938 INFO L226 Difference]: Without dead ends: 179 [2022-10-15 16:32:09,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:09,939 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 174 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:09,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 531 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-10-15 16:32:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2022-10-15 16:32:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 147 states have internal predecessors, (206), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-10-15 16:32:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2022-10-15 16:32:09,949 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 43 [2022-10-15 16:32:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:09,949 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2022-10-15 16:32:09,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2022-10-15 16:32:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 16:32:09,951 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:09,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:09,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:32:09,952 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1216392134, now seen corresponding path program 1 times [2022-10-15 16:32:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12522939] [2022-10-15 16:32:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:10,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12522939] [2022-10-15 16:32:10,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12522939] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:10,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:10,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:10,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782840176] [2022-10-15 16:32:10,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:10,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:10,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:10,023 INFO L87 Difference]: Start difference. First operand 163 states and 237 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:10,080 INFO L93 Difference]: Finished difference Result 178 states and 261 transitions. [2022-10-15 16:32:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:10,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-10-15 16:32:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:10,086 INFO L225 Difference]: With dead ends: 178 [2022-10-15 16:32:10,086 INFO L226 Difference]: Without dead ends: 178 [2022-10-15 16:32:10,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:10,088 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:10,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 536 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-10-15 16:32:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-10-15 16:32:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 146 states have (on average 1.417808219178082) internal successors, (207), 148 states have internal predecessors, (207), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-10-15 16:32:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2022-10-15 16:32:10,097 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 44 [2022-10-15 16:32:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:10,098 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2022-10-15 16:32:10,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2022-10-15 16:32:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 16:32:10,099 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:10,099 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:10,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:32:10,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1303567800, now seen corresponding path program 1 times [2022-10-15 16:32:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:10,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532780123] [2022-10-15 16:32:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:10,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532780123] [2022-10-15 16:32:10,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532780123] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:10,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:10,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:32:10,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259601474] [2022-10-15 16:32:10,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:10,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:32:10,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:32:10,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:10,180 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:10,246 INFO L93 Difference]: Finished difference Result 177 states and 256 transitions. [2022-10-15 16:32:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:10,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-10-15 16:32:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:10,248 INFO L225 Difference]: With dead ends: 177 [2022-10-15 16:32:10,249 INFO L226 Difference]: Without dead ends: 172 [2022-10-15 16:32:10,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:32:10,250 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 42 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:10,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 678 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-10-15 16:32:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-10-15 16:32:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 144 states have (on average 1.4097222222222223) internal successors, (203), 146 states have internal predecessors, (203), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-10-15 16:32:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2022-10-15 16:32:10,258 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2022-10-15 16:32:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:10,259 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2022-10-15 16:32:10,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2022-10-15 16:32:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 16:32:10,260 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:10,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:10,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:32:10,261 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1452225989, now seen corresponding path program 1 times [2022-10-15 16:32:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:10,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251749964] [2022-10-15 16:32:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251749964] [2022-10-15 16:32:10,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251749964] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5094202] [2022-10-15 16:32:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:10,520 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 16:32:10,536 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 16:32:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-15 16:32:10,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:32:10,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:10,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5094202] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:10,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:32:10,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 17 [2022-10-15 16:32:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937546569] [2022-10-15 16:32:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:10,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:32:10,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:10,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:32:10,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:32:10,924 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:11,036 INFO L93 Difference]: Finished difference Result 280 states and 400 transitions. [2022-10-15 16:32:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:11,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-10-15 16:32:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:11,040 INFO L225 Difference]: With dead ends: 280 [2022-10-15 16:32:11,040 INFO L226 Difference]: Without dead ends: 280 [2022-10-15 16:32:11,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:32:11,042 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 85 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:11,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 707 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-10-15 16:32:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2022-10-15 16:32:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 250 states have (on average 1.392) internal successors, (348), 251 states have internal predecessors, (348), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-10-15 16:32:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2022-10-15 16:32:11,060 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 395 transitions. Word has length 45 [2022-10-15 16:32:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:11,060 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 395 transitions. [2022-10-15 16:32:11,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 395 transitions. [2022-10-15 16:32:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 16:32:11,063 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:11,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:11,126 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 16:32:11,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,SelfDestructingSolverStorable9 [2022-10-15 16:32:11,277 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:11,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1831624057, now seen corresponding path program 1 times [2022-10-15 16:32:11,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:11,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399617715] [2022-10-15 16:32:11,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:11,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:11,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399617715] [2022-10-15 16:32:11,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399617715] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:11,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:11,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147510250] [2022-10-15 16:32:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:11,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:11,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:11,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:11,378 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:11,473 INFO L93 Difference]: Finished difference Result 382 states and 546 transitions. [2022-10-15 16:32:11,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:11,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-10-15 16:32:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:11,477 INFO L225 Difference]: With dead ends: 382 [2022-10-15 16:32:11,477 INFO L226 Difference]: Without dead ends: 382 [2022-10-15 16:32:11,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:11,478 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 186 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:11,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 538 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-10-15 16:32:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 311. [2022-10-15 16:32:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 284 states have (on average 1.3873239436619718) internal successors, (394), 284 states have internal predecessors, (394), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (27), 24 states have call predecessors, (27), 21 states have call successors, (27) [2022-10-15 16:32:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 443 transitions. [2022-10-15 16:32:11,498 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 443 transitions. Word has length 45 [2022-10-15 16:32:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:11,499 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 443 transitions. [2022-10-15 16:32:11,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 443 transitions. [2022-10-15 16:32:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:32:11,501 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:11,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:11,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:32:11,502 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:11,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1814326477, now seen corresponding path program 1 times [2022-10-15 16:32:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:11,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881862703] [2022-10-15 16:32:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:11,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881862703] [2022-10-15 16:32:11,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881862703] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:11,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071513720] [2022-10-15 16:32:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:11,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:11,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:11,829 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 16:32:11,848 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 16:32:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:11,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:32:11,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:11,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:11,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071513720] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:11,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:11,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-10-15 16:32:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186452856] [2022-10-15 16:32:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:11,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:32:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:32:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:32:11,944 INFO L87 Difference]: Start difference. First operand 311 states and 443 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:12,138 INFO L93 Difference]: Finished difference Result 587 states and 829 transitions. [2022-10-15 16:32:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:12,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-10-15 16:32:12,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:12,142 INFO L225 Difference]: With dead ends: 587 [2022-10-15 16:32:12,142 INFO L226 Difference]: Without dead ends: 587 [2022-10-15 16:32:12,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:32:12,144 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 181 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:12,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 693 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-10-15 16:32:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 467. [2022-10-15 16:32:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 428 states have (on average 1.3574766355140186) internal successors, (581), 429 states have internal predecessors, (581), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-10-15 16:32:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2022-10-15 16:32:12,163 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 48 [2022-10-15 16:32:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:12,163 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2022-10-15 16:32:12,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2022-10-15 16:32:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:32:12,165 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:12,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:12,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-15 16:32:12,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:12,382 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1113261899, now seen corresponding path program 1 times [2022-10-15 16:32:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:12,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451877837] [2022-10-15 16:32:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:12,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:12,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451877837] [2022-10-15 16:32:12,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451877837] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:12,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:12,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963202939] [2022-10-15 16:32:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:12,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:12,454 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:12,507 INFO L93 Difference]: Finished difference Result 479 states and 670 transitions. [2022-10-15 16:32:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-10-15 16:32:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:12,511 INFO L225 Difference]: With dead ends: 479 [2022-10-15 16:32:12,511 INFO L226 Difference]: Without dead ends: 451 [2022-10-15 16:32:12,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:12,512 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 38 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:12,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 528 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-10-15 16:32:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 443. [2022-10-15 16:32:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 404 states have (on average 1.3514851485148516) internal successors, (546), 405 states have internal predecessors, (546), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (38), 35 states have call predecessors, (38), 32 states have call successors, (38) [2022-10-15 16:32:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 618 transitions. [2022-10-15 16:32:12,529 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 618 transitions. Word has length 48 [2022-10-15 16:32:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:12,530 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 618 transitions. [2022-10-15 16:32:12,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 618 transitions. [2022-10-15 16:32:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:32:12,531 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:12,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:12,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:32:12,532 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:12,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash 732452959, now seen corresponding path program 1 times [2022-10-15 16:32:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:12,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939800432] [2022-10-15 16:32:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:12,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939800432] [2022-10-15 16:32:12,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939800432] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:12,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:12,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104095538] [2022-10-15 16:32:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:12,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:12,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:12,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:12,599 INFO L87 Difference]: Start difference. First operand 443 states and 618 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:12,672 INFO L93 Difference]: Finished difference Result 574 states and 771 transitions. [2022-10-15 16:32:12,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:12,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-10-15 16:32:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:12,676 INFO L225 Difference]: With dead ends: 574 [2022-10-15 16:32:12,677 INFO L226 Difference]: Without dead ends: 524 [2022-10-15 16:32:12,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:12,678 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 75 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:12,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 426 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-10-15 16:32:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 448. [2022-10-15 16:32:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 409 states have (on average 1.3227383863080684) internal successors, (541), 410 states have internal predecessors, (541), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (38), 35 states have call predecessors, (38), 32 states have call successors, (38) [2022-10-15 16:32:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 613 transitions. [2022-10-15 16:32:12,696 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 613 transitions. Word has length 48 [2022-10-15 16:32:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:12,697 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 613 transitions. [2022-10-15 16:32:12,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 613 transitions. [2022-10-15 16:32:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:32:12,698 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:12,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:32:12,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:32:12,699 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash 179818229, now seen corresponding path program 1 times [2022-10-15 16:32:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:12,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712593356] [2022-10-15 16:32:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:12,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:12,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712593356] [2022-10-15 16:32:12,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712593356] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:12,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:12,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:32:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918377211] [2022-10-15 16:32:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:12,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:32:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:32:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:32:12,995 INFO L87 Difference]: Start difference. First operand 448 states and 613 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:13,267 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2022-10-15 16:32:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:32:13,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-10-15 16:32:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:13,271 INFO L225 Difference]: With dead ends: 543 [2022-10-15 16:32:13,271 INFO L226 Difference]: Without dead ends: 533 [2022-10-15 16:32:13,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:32:13,273 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 122 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:13,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1660 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-10-15 16:32:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 445. [2022-10-15 16:32:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 406 states have (on average 1.3251231527093597) internal successors, (538), 408 states have internal predecessors, (538), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-10-15 16:32:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 608 transitions. [2022-10-15 16:32:13,289 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 608 transitions. Word has length 48 [2022-10-15 16:32:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:13,290 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 608 transitions. [2022-10-15 16:32:13,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 608 transitions. [2022-10-15 16:32:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-15 16:32:13,292 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:13,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:13,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 16:32:13,292 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:13,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1400502678, now seen corresponding path program 1 times [2022-10-15 16:32:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:13,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735470942] [2022-10-15 16:32:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:13,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:13,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:13,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735470942] [2022-10-15 16:32:13,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735470942] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:13,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121836656] [2022-10-15 16:32:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:13,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:13,489 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 16:32:13,508 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 16:32:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 16:32:13,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:13,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121836656] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:13,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:13,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-10-15 16:32:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178095993] [2022-10-15 16:32:13,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:13,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 16:32:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:13,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 16:32:13,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:32:13,757 INFO L87 Difference]: Start difference. First operand 445 states and 608 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:14,478 INFO L93 Difference]: Finished difference Result 840 states and 1113 transitions. [2022-10-15 16:32:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:32:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-10-15 16:32:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:14,483 INFO L225 Difference]: With dead ends: 840 [2022-10-15 16:32:14,483 INFO L226 Difference]: Without dead ends: 808 [2022-10-15 16:32:14,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-10-15 16:32:14,485 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 538 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:14,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2018 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 16:32:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-10-15 16:32:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 644. [2022-10-15 16:32:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 589 states have (on average 1.2767402376910018) internal successors, (752), 592 states have internal predecessors, (752), 49 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (56), 50 states have call predecessors, (56), 46 states have call successors, (56) [2022-10-15 16:32:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 857 transitions. [2022-10-15 16:32:14,514 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 857 transitions. Word has length 49 [2022-10-15 16:32:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:14,515 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 857 transitions. [2022-10-15 16:32:14,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 857 transitions. [2022-10-15 16:32:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-15 16:32:14,517 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:14,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:14,562 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 16:32:14,731 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,SelfDestructingSolverStorable15 [2022-10-15 16:32:14,732 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1766342568, now seen corresponding path program 1 times [2022-10-15 16:32:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260597760] [2022-10-15 16:32:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:32:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:15,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260597760] [2022-10-15 16:32:15,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260597760] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:15,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585974602] [2022-10-15 16:32:15,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:15,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:15,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 16:32:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:32:15,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:15,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:15,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585974602] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:15,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:15,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2022-10-15 16:32:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059500633] [2022-10-15 16:32:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:15,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:32:15,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:15,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:32:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-10-15 16:32:15,758 INFO L87 Difference]: Start difference. First operand 644 states and 857 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:16,075 INFO L93 Difference]: Finished difference Result 823 states and 1097 transitions. [2022-10-15 16:32:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:16,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-10-15 16:32:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:16,080 INFO L225 Difference]: With dead ends: 823 [2022-10-15 16:32:16,080 INFO L226 Difference]: Without dead ends: 823 [2022-10-15 16:32:16,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:32:16,083 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 278 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:16,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1175 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-10-15 16:32:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 673. [2022-10-15 16:32:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 616 states have (on average 1.271103896103896) internal successors, (783), 620 states have internal predecessors, (783), 51 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (58), 52 states have call predecessors, (58), 48 states have call successors, (58) [2022-10-15 16:32:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 892 transitions. [2022-10-15 16:32:16,152 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 892 transitions. Word has length 50 [2022-10-15 16:32:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:16,153 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 892 transitions. [2022-10-15 16:32:16,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 892 transitions. [2022-10-15 16:32:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 16:32:16,155 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:16,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:16,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:16,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 16:32:16,371 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 904625488, now seen corresponding path program 1 times [2022-10-15 16:32:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:16,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934881667] [2022-10-15 16:32:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 16:32:16,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:16,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934881667] [2022-10-15 16:32:16,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934881667] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:16,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:16,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:32:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723631876] [2022-10-15 16:32:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:16,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:32:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:32:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:16,493 INFO L87 Difference]: Start difference. First operand 673 states and 892 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:16,590 INFO L93 Difference]: Finished difference Result 724 states and 963 transitions. [2022-10-15 16:32:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:16,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-10-15 16:32:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:16,595 INFO L225 Difference]: With dead ends: 724 [2022-10-15 16:32:16,595 INFO L226 Difference]: Without dead ends: 724 [2022-10-15 16:32:16,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:16,597 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 78 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:16,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 840 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-10-15 16:32:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 682. [2022-10-15 16:32:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 621 states have (on average 1.2689210950080516) internal successors, (788), 628 states have internal predecessors, (788), 54 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (61), 52 states have call predecessors, (61), 51 states have call successors, (61) [2022-10-15 16:32:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 903 transitions. [2022-10-15 16:32:16,620 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 903 transitions. Word has length 51 [2022-10-15 16:32:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:16,621 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 903 transitions. [2022-10-15 16:32:16,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 903 transitions. [2022-10-15 16:32:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 16:32:16,623 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:16,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 16:32:16,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 16:32:16,623 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash 354566180, now seen corresponding path program 1 times [2022-10-15 16:32:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33905609] [2022-10-15 16:32:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33905609] [2022-10-15 16:32:16,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33905609] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:16,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:16,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395237439] [2022-10-15 16:32:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:16,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:16,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:16,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:16,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:16,695 INFO L87 Difference]: Start difference. First operand 682 states and 903 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:16,750 INFO L93 Difference]: Finished difference Result 692 states and 919 transitions. [2022-10-15 16:32:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:16,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-10-15 16:32:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:16,755 INFO L225 Difference]: With dead ends: 692 [2022-10-15 16:32:16,755 INFO L226 Difference]: Without dead ends: 673 [2022-10-15 16:32:16,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:16,756 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 38 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:16,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 516 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-10-15 16:32:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 567. [2022-10-15 16:32:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 515 states have (on average 1.2757281553398059) internal successors, (657), 521 states have internal predecessors, (657), 45 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (52), 43 states have call predecessors, (52), 42 states have call successors, (52) [2022-10-15 16:32:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 754 transitions. [2022-10-15 16:32:16,777 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 754 transitions. Word has length 52 [2022-10-15 16:32:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:16,777 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 754 transitions. [2022-10-15 16:32:16,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 754 transitions. [2022-10-15 16:32:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 16:32:16,779 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:16,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:16,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 16:32:16,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:16,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash -998063848, now seen corresponding path program 1 times [2022-10-15 16:32:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:16,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146745772] [2022-10-15 16:32:16,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-15 16:32:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:16,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:16,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146745772] [2022-10-15 16:32:16,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146745772] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:16,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:16,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:32:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048447194] [2022-10-15 16:32:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:16,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:32:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:32:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:32:16,985 INFO L87 Difference]: Start difference. First operand 567 states and 754 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:17,271 INFO L93 Difference]: Finished difference Result 1049 states and 1393 transitions. [2022-10-15 16:32:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:17,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-10-15 16:32:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:17,278 INFO L225 Difference]: With dead ends: 1049 [2022-10-15 16:32:17,278 INFO L226 Difference]: Without dead ends: 1047 [2022-10-15 16:32:17,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:32:17,279 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 184 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:17,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1531 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-10-15 16:32:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 916. [2022-10-15 16:32:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 840 states have (on average 1.2642857142857142) internal successors, (1062), 847 states have internal predecessors, (1062), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (76), 68 states have call predecessors, (76), 66 states have call successors, (76) [2022-10-15 16:32:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1207 transitions. [2022-10-15 16:32:17,313 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1207 transitions. Word has length 57 [2022-10-15 16:32:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:17,313 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1207 transitions. [2022-10-15 16:32:17,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1207 transitions. [2022-10-15 16:32:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:32:17,315 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:17,316 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:17,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 16:32:17,316 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1200541885, now seen corresponding path program 1 times [2022-10-15 16:32:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:17,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003820965] [2022-10-15 16:32:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:17,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:17,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003820965] [2022-10-15 16:32:17,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003820965] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:17,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139459584] [2022-10-15 16:32:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:17,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:17,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:17,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 16:32:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 16:32:17,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:17,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:17,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139459584] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:17,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:17,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-10-15 16:32:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573425433] [2022-10-15 16:32:17,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:17,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:32:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:32:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:32:17,743 INFO L87 Difference]: Start difference. First operand 916 states and 1207 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:18,040 INFO L93 Difference]: Finished difference Result 1547 states and 2050 transitions. [2022-10-15 16:32:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:32:18,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-10-15 16:32:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:18,049 INFO L225 Difference]: With dead ends: 1547 [2022-10-15 16:32:18,049 INFO L226 Difference]: Without dead ends: 1543 [2022-10-15 16:32:18,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:32:18,050 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 240 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:18,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2609 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-10-15 16:32:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 928. [2022-10-15 16:32:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 852 states have (on average 1.2629107981220657) internal successors, (1076), 859 states have internal predecessors, (1076), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (76), 68 states have call predecessors, (76), 66 states have call successors, (76) [2022-10-15 16:32:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1221 transitions. [2022-10-15 16:32:18,089 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1221 transitions. Word has length 58 [2022-10-15 16:32:18,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:18,090 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1221 transitions. [2022-10-15 16:32:18,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1221 transitions. [2022-10-15 16:32:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:32:18,092 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:18,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:18,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:18,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:18,307 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:18,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1334555391, now seen corresponding path program 1 times [2022-10-15 16:32:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:18,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137638608] [2022-10-15 16:32:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:18,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:18,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:18,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137638608] [2022-10-15 16:32:18,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137638608] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:18,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578106749] [2022-10-15 16:32:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:18,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:18,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:18,493 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:18,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 16:32:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:18,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:32:18,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:18,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578106749] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:18,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-15 16:32:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519680037] [2022-10-15 16:32:18,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:18,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-15 16:32:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-15 16:32:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:32:18,775 INFO L87 Difference]: Start difference. First operand 928 states and 1221 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:19,196 INFO L93 Difference]: Finished difference Result 2068 states and 2798 transitions. [2022-10-15 16:32:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 16:32:19,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-10-15 16:32:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:19,208 INFO L225 Difference]: With dead ends: 2068 [2022-10-15 16:32:19,209 INFO L226 Difference]: Without dead ends: 2046 [2022-10-15 16:32:19,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:32:19,210 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 229 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 3769 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:19,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 3769 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:32:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-10-15 16:32:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 908. [2022-10-15 16:32:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 833 states have (on average 1.2665066026410565) internal successors, (1055), 842 states have internal predecessors, (1055), 68 states have call successors, (68), 4 states have call predecessors, (68), 6 states have return successors, (72), 65 states have call predecessors, (72), 65 states have call successors, (72) [2022-10-15 16:32:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1195 transitions. [2022-10-15 16:32:19,263 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1195 transitions. Word has length 58 [2022-10-15 16:32:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:19,263 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1195 transitions. [2022-10-15 16:32:19,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1195 transitions. [2022-10-15 16:32:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:32:19,266 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:19,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:19,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:19,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:19,481 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 945870915, now seen corresponding path program 1 times [2022-10-15 16:32:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:19,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291594322] [2022-10-15 16:32:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:19,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291594322] [2022-10-15 16:32:19,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291594322] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:19,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:19,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:32:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649861823] [2022-10-15 16:32:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:19,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:32:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:19,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:32:19,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:32:19,611 INFO L87 Difference]: Start difference. First operand 908 states and 1195 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:19,753 INFO L93 Difference]: Finished difference Result 789 states and 1034 transitions. [2022-10-15 16:32:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:19,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2022-10-15 16:32:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:19,758 INFO L225 Difference]: With dead ends: 789 [2022-10-15 16:32:19,759 INFO L226 Difference]: Without dead ends: 752 [2022-10-15 16:32:19,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:19,760 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 44 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:19,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 869 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-10-15 16:32:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 744. [2022-10-15 16:32:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 679 states have (on average 1.2709867452135493) internal successors, (863), 689 states have internal predecessors, (863), 59 states have call successors, (59), 4 states have call predecessors, (59), 5 states have return successors, (59), 54 states have call predecessors, (59), 56 states have call successors, (59) [2022-10-15 16:32:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 981 transitions. [2022-10-15 16:32:19,786 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 981 transitions. Word has length 58 [2022-10-15 16:32:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:19,787 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 981 transitions. [2022-10-15 16:32:19,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 981 transitions. [2022-10-15 16:32:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-15 16:32:19,789 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:19,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:19,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-15 16:32:19,790 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:19,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:19,791 INFO L85 PathProgramCache]: Analyzing trace with hash 392059121, now seen corresponding path program 1 times [2022-10-15 16:32:19,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:19,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249743304] [2022-10-15 16:32:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-15 16:32:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:19,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249743304] [2022-10-15 16:32:19,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249743304] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:19,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:19,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438649796] [2022-10-15 16:32:19,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:19,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:19,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:19,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:19,869 INFO L87 Difference]: Start difference. First operand 744 states and 981 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:19,951 INFO L93 Difference]: Finished difference Result 764 states and 1014 transitions. [2022-10-15 16:32:19,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:19,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2022-10-15 16:32:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:19,955 INFO L225 Difference]: With dead ends: 764 [2022-10-15 16:32:19,956 INFO L226 Difference]: Without dead ends: 764 [2022-10-15 16:32:19,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 16:32:19,957 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 55 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:19,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 355 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-10-15 16:32:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 745. [2022-10-15 16:32:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 680 states have (on average 1.2705882352941176) internal successors, (864), 690 states have internal predecessors, (864), 59 states have call successors, (59), 4 states have call predecessors, (59), 5 states have return successors, (59), 54 states have call predecessors, (59), 56 states have call successors, (59) [2022-10-15 16:32:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 982 transitions. [2022-10-15 16:32:19,980 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 982 transitions. Word has length 59 [2022-10-15 16:32:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:19,981 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 982 transitions. [2022-10-15 16:32:19,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 982 transitions. [2022-10-15 16:32:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 16:32:19,983 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:19,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:19,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-15 16:32:19,984 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2041465448, now seen corresponding path program 1 times [2022-10-15 16:32:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:19,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066414950] [2022-10-15 16:32:19,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 16:32:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:20,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066414950] [2022-10-15 16:32:20,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066414950] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:20,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116170910] [2022-10-15 16:32:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:20,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:20,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:20,259 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:20,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 16:32:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-15 16:32:20,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:20,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:21,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116170910] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:21,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:32:21,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 26 [2022-10-15 16:32:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651766653] [2022-10-15 16:32:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:21,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:32:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:21,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:32:21,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-10-15 16:32:21,198 INFO L87 Difference]: Start difference. First operand 745 states and 982 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:21,677 INFO L93 Difference]: Finished difference Result 1159 states and 1524 transitions. [2022-10-15 16:32:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:32:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-10-15 16:32:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:21,683 INFO L225 Difference]: With dead ends: 1159 [2022-10-15 16:32:21,683 INFO L226 Difference]: Without dead ends: 1147 [2022-10-15 16:32:21,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-10-15 16:32:21,684 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 240 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:21,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1715 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-10-15 16:32:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1000. [2022-10-15 16:32:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 912 states have (on average 1.2763157894736843) internal successors, (1164), 923 states have internal predecessors, (1164), 81 states have call successors, (81), 4 states have call predecessors, (81), 6 states have return successors, (84), 77 states have call predecessors, (84), 78 states have call successors, (84) [2022-10-15 16:32:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1329 transitions. [2022-10-15 16:32:21,720 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1329 transitions. Word has length 60 [2022-10-15 16:32:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:21,720 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1329 transitions. [2022-10-15 16:32:21,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1329 transitions. [2022-10-15 16:32:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:21,723 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:21,723 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:21,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:21,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-10-15 16:32:21,937 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash 5813246, now seen corresponding path program 1 times [2022-10-15 16:32:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:21,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74159268] [2022-10-15 16:32:21,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:21,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 16:32:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 16:32:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:22,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74159268] [2022-10-15 16:32:22,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74159268] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:22,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:22,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:32:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042956068] [2022-10-15 16:32:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:22,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:32:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:22,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:32:22,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:22,066 INFO L87 Difference]: Start difference. First operand 1000 states and 1329 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:32:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:22,160 INFO L93 Difference]: Finished difference Result 1036 states and 1375 transitions. [2022-10-15 16:32:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:22,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-10-15 16:32:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:22,167 INFO L225 Difference]: With dead ends: 1036 [2022-10-15 16:32:22,167 INFO L226 Difference]: Without dead ends: 1034 [2022-10-15 16:32:22,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:22,168 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:22,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 820 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-10-15 16:32:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 995. [2022-10-15 16:32:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 906 states have (on average 1.2759381898454747) internal successors, (1156), 919 states have internal predecessors, (1156), 81 states have call successors, (81), 5 states have call predecessors, (81), 7 states have return successors, (84), 75 states have call predecessors, (84), 78 states have call successors, (84) [2022-10-15 16:32:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1321 transitions. [2022-10-15 16:32:22,198 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1321 transitions. Word has length 62 [2022-10-15 16:32:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:22,198 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1321 transitions. [2022-10-15 16:32:22,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:32:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1321 transitions. [2022-10-15 16:32:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:22,220 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:22,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:22,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-15 16:32:22,221 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:22,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash 63071548, now seen corresponding path program 1 times [2022-10-15 16:32:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:22,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578509088] [2022-10-15 16:32:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:22,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 16:32:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 16:32:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:22,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578509088] [2022-10-15 16:32:22,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578509088] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:22,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:22,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:32:22,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023442873] [2022-10-15 16:32:22,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:22,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:32:22,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:22,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:32:22,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:22,356 INFO L87 Difference]: Start difference. First operand 995 states and 1321 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:32:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:22,449 INFO L93 Difference]: Finished difference Result 1026 states and 1360 transitions. [2022-10-15 16:32:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:22,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-10-15 16:32:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:22,455 INFO L225 Difference]: With dead ends: 1026 [2022-10-15 16:32:22,455 INFO L226 Difference]: Without dead ends: 1014 [2022-10-15 16:32:22,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:22,456 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:22,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 820 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2022-10-15 16:32:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 980. [2022-10-15 16:32:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 894 states have (on average 1.2706935123042506) internal successors, (1136), 905 states have internal predecessors, (1136), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-10-15 16:32:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1294 transitions. [2022-10-15 16:32:22,484 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1294 transitions. Word has length 62 [2022-10-15 16:32:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:22,485 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1294 transitions. [2022-10-15 16:32:22,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:32:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1294 transitions. [2022-10-15 16:32:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:22,487 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:22,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:22,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-15 16:32:22,488 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1014097779, now seen corresponding path program 1 times [2022-10-15 16:32:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:22,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684027410] [2022-10-15 16:32:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 16:32:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:22,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:22,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684027410] [2022-10-15 16:32:22,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684027410] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:22,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590797513] [2022-10-15 16:32:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:22,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:22,773 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:22,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 16:32:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-15 16:32:22,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 16:32:23,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:23,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590797513] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:23,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:23,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-10-15 16:32:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362654302] [2022-10-15 16:32:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:23,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:32:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:23,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:32:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:32:23,017 INFO L87 Difference]: Start difference. First operand 980 states and 1294 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:23,213 INFO L93 Difference]: Finished difference Result 1222 states and 1628 transitions. [2022-10-15 16:32:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:23,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-10-15 16:32:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:23,220 INFO L225 Difference]: With dead ends: 1222 [2022-10-15 16:32:23,220 INFO L226 Difference]: Without dead ends: 1213 [2022-10-15 16:32:23,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:32:23,221 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 151 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:23,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 693 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-10-15 16:32:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 980. [2022-10-15 16:32:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 894 states have (on average 1.2684563758389262) internal successors, (1134), 905 states have internal predecessors, (1134), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-10-15 16:32:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1292 transitions. [2022-10-15 16:32:23,251 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1292 transitions. Word has length 62 [2022-10-15 16:32:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:23,251 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1292 transitions. [2022-10-15 16:32:23,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1292 transitions. [2022-10-15 16:32:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:23,253 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:23,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:23,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:23,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-15 16:32:23,467 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1748624208, now seen corresponding path program 1 times [2022-10-15 16:32:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:23,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561651422] [2022-10-15 16:32:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:23,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:23,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:23,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561651422] [2022-10-15 16:32:23,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561651422] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:23,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:23,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 16:32:23,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996233244] [2022-10-15 16:32:23,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:23,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:32:23,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:23,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:32:23,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:32:23,698 INFO L87 Difference]: Start difference. First operand 980 states and 1292 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:23,946 INFO L93 Difference]: Finished difference Result 1189 states and 1546 transitions. [2022-10-15 16:32:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:32:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-10-15 16:32:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:23,953 INFO L225 Difference]: With dead ends: 1189 [2022-10-15 16:32:23,953 INFO L226 Difference]: Without dead ends: 1189 [2022-10-15 16:32:23,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:32:23,954 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 212 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:23,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1047 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-10-15 16:32:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1055. [2022-10-15 16:32:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 969 states have (on average 1.2445820433436532) internal successors, (1206), 980 states have internal predecessors, (1206), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-10-15 16:32:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1364 transitions. [2022-10-15 16:32:23,986 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1364 transitions. Word has length 62 [2022-10-15 16:32:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:23,986 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1364 transitions. [2022-10-15 16:32:23,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1364 transitions. [2022-10-15 16:32:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:23,989 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:23,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:23,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-10-15 16:32:23,990 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:23,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1746777166, now seen corresponding path program 1 times [2022-10-15 16:32:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:23,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551815390] [2022-10-15 16:32:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:23,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:24,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551815390] [2022-10-15 16:32:24,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551815390] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:24,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:24,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-15 16:32:24,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531484869] [2022-10-15 16:32:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:24,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:32:24,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:32:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:32:24,494 INFO L87 Difference]: Start difference. First operand 1055 states and 1364 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:25,249 INFO L93 Difference]: Finished difference Result 1116 states and 1438 transitions. [2022-10-15 16:32:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:32:25,249 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2022-10-15 16:32:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:25,255 INFO L225 Difference]: With dead ends: 1116 [2022-10-15 16:32:25,256 INFO L226 Difference]: Without dead ends: 1116 [2022-10-15 16:32:25,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-10-15 16:32:25,257 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 385 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:25,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1628 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 16:32:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-10-15 16:32:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1065. [2022-10-15 16:32:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 977 states have (on average 1.2425793244626406) internal successors, (1214), 989 states have internal predecessors, (1214), 79 states have call successors, (79), 6 states have call predecessors, (79), 8 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2022-10-15 16:32:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1374 transitions. [2022-10-15 16:32:25,290 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1374 transitions. Word has length 62 [2022-10-15 16:32:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:25,291 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1374 transitions. [2022-10-15 16:32:25,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1374 transitions. [2022-10-15 16:32:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:25,294 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:25,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:25,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-10-15 16:32:25,295 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1562736060, now seen corresponding path program 1 times [2022-10-15 16:32:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:25,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550430526] [2022-10-15 16:32:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:25,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:25,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550430526] [2022-10-15 16:32:25,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550430526] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:25,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117898196] [2022-10-15 16:32:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:25,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:25,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 16:32:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:32:25,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:25,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:25,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117898196] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:25,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:25,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-10-15 16:32:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018553276] [2022-10-15 16:32:25,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:25,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:32:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:25,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:32:25,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:32:25,702 INFO L87 Difference]: Start difference. First operand 1065 states and 1374 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:26,037 INFO L93 Difference]: Finished difference Result 2732 states and 3570 transitions. [2022-10-15 16:32:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:32:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-10-15 16:32:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:26,051 INFO L225 Difference]: With dead ends: 2732 [2022-10-15 16:32:26,051 INFO L226 Difference]: Without dead ends: 2732 [2022-10-15 16:32:26,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:32:26,053 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 296 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:26,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1946 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2022-10-15 16:32:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1170. [2022-10-15 16:32:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1080 states have (on average 1.2361111111111112) internal successors, (1335), 1090 states have internal predecessors, (1335), 80 states have call successors, (80), 6 states have call predecessors, (80), 9 states have return successors, (88), 78 states have call predecessors, (88), 76 states have call successors, (88) [2022-10-15 16:32:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1503 transitions. [2022-10-15 16:32:26,102 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1503 transitions. Word has length 65 [2022-10-15 16:32:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:26,103 INFO L495 AbstractCegarLoop]: Abstraction has 1170 states and 1503 transitions. [2022-10-15 16:32:26,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1503 transitions. [2022-10-15 16:32:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:26,105 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:26,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:26,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:26,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-10-15 16:32:26,322 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:26,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:26,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1043287494, now seen corresponding path program 1 times [2022-10-15 16:32:26,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:26,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542272374] [2022-10-15 16:32:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:26,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:26,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542272374] [2022-10-15 16:32:26,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542272374] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:26,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838192853] [2022-10-15 16:32:26,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:26,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:26,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:26,458 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:26,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 16:32:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:32:26,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:26,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:26,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838192853] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:26,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:26,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-10-15 16:32:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110058352] [2022-10-15 16:32:26,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:26,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 16:32:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:26,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 16:32:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:32:26,862 INFO L87 Difference]: Start difference. First operand 1170 states and 1503 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:32:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:27,693 INFO L93 Difference]: Finished difference Result 2880 states and 3778 transitions. [2022-10-15 16:32:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-15 16:32:27,694 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-10-15 16:32:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:27,723 INFO L225 Difference]: With dead ends: 2880 [2022-10-15 16:32:27,729 INFO L226 Difference]: Without dead ends: 2835 [2022-10-15 16:32:27,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-10-15 16:32:27,733 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 646 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:27,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1736 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:32:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-10-15 16:32:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1230. [2022-10-15 16:32:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1138 states have (on average 1.2319859402460458) internal successors, (1402), 1146 states have internal predecessors, (1402), 81 states have call successors, (81), 6 states have call predecessors, (81), 10 states have return successors, (97), 82 states have call predecessors, (97), 77 states have call successors, (97) [2022-10-15 16:32:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1580 transitions. [2022-10-15 16:32:27,793 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1580 transitions. Word has length 65 [2022-10-15 16:32:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:27,793 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1580 transitions. [2022-10-15 16:32:27,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:32:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1580 transitions. [2022-10-15 16:32:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:27,797 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:27,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:27,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:28,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-10-15 16:32:28,011 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1428722554, now seen corresponding path program 1 times [2022-10-15 16:32:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:28,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054894722] [2022-10-15 16:32:28,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:28,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:28,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054894722] [2022-10-15 16:32:28,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054894722] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:28,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433855433] [2022-10-15 16:32:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:28,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:28,205 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:28,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 16:32:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:32:28,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:28,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:28,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433855433] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:28,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:28,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-10-15 16:32:28,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30041697] [2022-10-15 16:32:28,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:28,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:32:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:28,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:32:28,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:28,448 INFO L87 Difference]: Start difference. First operand 1230 states and 1580 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:28,962 INFO L93 Difference]: Finished difference Result 3274 states and 4397 transitions. [2022-10-15 16:32:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 16:32:28,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-10-15 16:32:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:28,973 INFO L225 Difference]: With dead ends: 3274 [2022-10-15 16:32:28,973 INFO L226 Difference]: Without dead ends: 3274 [2022-10-15 16:32:28,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:32:28,974 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 363 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:28,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 2683 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 16:32:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2022-10-15 16:32:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 1356. [2022-10-15 16:32:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1264 states have (on average 1.2231012658227849) internal successors, (1546), 1272 states have internal predecessors, (1546), 81 states have call successors, (81), 6 states have call predecessors, (81), 10 states have return successors, (97), 82 states have call predecessors, (97), 77 states have call successors, (97) [2022-10-15 16:32:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1724 transitions. [2022-10-15 16:32:29,062 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1724 transitions. Word has length 65 [2022-10-15 16:32:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:29,062 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1724 transitions. [2022-10-15 16:32:29,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1724 transitions. [2022-10-15 16:32:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:29,065 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:29,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:29,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:29,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-10-15 16:32:29,279 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1823596606, now seen corresponding path program 1 times [2022-10-15 16:32:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:29,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542680736] [2022-10-15 16:32:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:29,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:29,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542680736] [2022-10-15 16:32:29,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542680736] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:29,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341040240] [2022-10-15 16:32:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:29,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:29,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:29,448 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:29,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-15 16:32:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-15 16:32:29,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:29,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:29,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341040240] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:29,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:29,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-10-15 16:32:29,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460414280] [2022-10-15 16:32:29,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:29,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-15 16:32:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:29,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-15 16:32:29,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:32:29,872 INFO L87 Difference]: Start difference. First operand 1356 states and 1724 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:32:30,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:30,995 INFO L93 Difference]: Finished difference Result 3861 states and 5128 transitions. [2022-10-15 16:32:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-15 16:32:30,996 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-10-15 16:32:30,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:31,005 INFO L225 Difference]: With dead ends: 3861 [2022-10-15 16:32:31,006 INFO L226 Difference]: Without dead ends: 3598 [2022-10-15 16:32:31,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=284, Invalid=1522, Unknown=0, NotChecked=0, Total=1806 [2022-10-15 16:32:31,008 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 1038 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:31,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1771 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:32:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2022-10-15 16:32:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 1272. [2022-10-15 16:32:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1181 states have (on average 1.2277730736663843) internal successors, (1450), 1192 states have internal predecessors, (1450), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 78 states have call predecessors, (91), 76 states have call successors, (91) [2022-10-15 16:32:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1621 transitions. [2022-10-15 16:32:31,066 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1621 transitions. Word has length 65 [2022-10-15 16:32:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:31,066 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1621 transitions. [2022-10-15 16:32:31,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:32:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1621 transitions. [2022-10-15 16:32:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:31,069 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:31,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:31,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:31,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-10-15 16:32:31,284 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1837881621, now seen corresponding path program 1 times [2022-10-15 16:32:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:31,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105718952] [2022-10-15 16:32:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:31,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 16:32:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:31,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105718952] [2022-10-15 16:32:31,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105718952] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:31,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336718962] [2022-10-15 16:32:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:31,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:31,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:31,432 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:31,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-15 16:32:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:31,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:32:31,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 16:32:31,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:31,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336718962] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:31,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:31,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-10-15 16:32:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223174333] [2022-10-15 16:32:31,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:31,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:31,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:31,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:31,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:31,545 INFO L87 Difference]: Start difference. First operand 1272 states and 1621 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:31,613 INFO L93 Difference]: Finished difference Result 1306 states and 1674 transitions. [2022-10-15 16:32:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-10-15 16:32:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:31,618 INFO L225 Difference]: With dead ends: 1306 [2022-10-15 16:32:31,618 INFO L226 Difference]: Without dead ends: 1306 [2022-10-15 16:32:31,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:31,620 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 36 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:31,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 267 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-10-15 16:32:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1281. [2022-10-15 16:32:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1190 states have (on average 1.2285714285714286) internal successors, (1462), 1201 states have internal predecessors, (1462), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 78 states have call predecessors, (91), 76 states have call successors, (91) [2022-10-15 16:32:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1633 transitions. [2022-10-15 16:32:31,647 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1633 transitions. Word has length 65 [2022-10-15 16:32:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:31,647 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1633 transitions. [2022-10-15 16:32:31,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1633 transitions. [2022-10-15 16:32:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:31,651 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:31,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:31,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:31,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:31,864 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash -4708558, now seen corresponding path program 2 times [2022-10-15 16:32:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:31,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161121094] [2022-10-15 16:32:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:32,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:32,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161121094] [2022-10-15 16:32:32,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161121094] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:32,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:32,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:32:32,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417594657] [2022-10-15 16:32:32,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:32,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:32:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:32:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:32:32,039 INFO L87 Difference]: Start difference. First operand 1281 states and 1633 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:32,388 INFO L93 Difference]: Finished difference Result 2247 states and 2953 transitions. [2022-10-15 16:32:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:32:32,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-10-15 16:32:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:32,394 INFO L225 Difference]: With dead ends: 2247 [2022-10-15 16:32:32,395 INFO L226 Difference]: Without dead ends: 2247 [2022-10-15 16:32:32,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:32:32,396 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 246 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:32,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 2258 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:32:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-10-15 16:32:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1434. [2022-10-15 16:32:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1343 states have (on average 1.2204020848845867) internal successors, (1639), 1351 states have internal predecessors, (1639), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 81 states have call predecessors, (91), 76 states have call successors, (91) [2022-10-15 16:32:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1810 transitions. [2022-10-15 16:32:32,432 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1810 transitions. Word has length 65 [2022-10-15 16:32:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:32,433 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1810 transitions. [2022-10-15 16:32:32,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1810 transitions. [2022-10-15 16:32:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:32,436 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:32,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:32,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-10-15 16:32:32,437 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash -399582610, now seen corresponding path program 1 times [2022-10-15 16:32:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:32,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415546585] [2022-10-15 16:32:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:32,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:32,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415546585] [2022-10-15 16:32:32,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415546585] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:32,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:32,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 16:32:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911745375] [2022-10-15 16:32:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:32,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:32:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:32:32,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:32:32,574 INFO L87 Difference]: Start difference. First operand 1434 states and 1810 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:32,896 INFO L93 Difference]: Finished difference Result 2423 states and 3133 transitions. [2022-10-15 16:32:32,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:32:32,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-10-15 16:32:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:32,903 INFO L225 Difference]: With dead ends: 2423 [2022-10-15 16:32:32,903 INFO L226 Difference]: Without dead ends: 2306 [2022-10-15 16:32:32,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:32:32,904 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 309 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:32,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 940 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-10-15 16:32:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1432. [2022-10-15 16:32:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1341 states have (on average 1.2192393736017897) internal successors, (1635), 1347 states have internal predecessors, (1635), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (90), 83 states have call predecessors, (90), 76 states have call successors, (90) [2022-10-15 16:32:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1805 transitions. [2022-10-15 16:32:32,940 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1805 transitions. Word has length 65 [2022-10-15 16:32:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:32,940 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1805 transitions. [2022-10-15 16:32:32,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1805 transitions. [2022-10-15 16:32:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-15 16:32:32,944 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:32,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:32,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-10-15 16:32:32,944 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash -613313466, now seen corresponding path program 1 times [2022-10-15 16:32:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:32,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373400098] [2022-10-15 16:32:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-15 16:32:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:33,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373400098] [2022-10-15 16:32:33,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373400098] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:33,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192294529] [2022-10-15 16:32:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:33,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:33,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:33,011 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:33,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-15 16:32:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:33,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 16:32:33,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 16:32:33,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:33,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192294529] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:33,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:33,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-10-15 16:32:33,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750328993] [2022-10-15 16:32:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:33,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:33,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:33,119 INFO L87 Difference]: Start difference. First operand 1432 states and 1805 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:33,165 INFO L93 Difference]: Finished difference Result 1443 states and 1824 transitions. [2022-10-15 16:32:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:33,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-10-15 16:32:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:33,171 INFO L225 Difference]: With dead ends: 1443 [2022-10-15 16:32:33,171 INFO L226 Difference]: Without dead ends: 1443 [2022-10-15 16:32:33,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:33,172 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 14 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:33,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 410 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-10-15 16:32:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1433. [2022-10-15 16:32:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1342 states have (on average 1.2198211624441133) internal successors, (1637), 1348 states have internal predecessors, (1637), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (90), 83 states have call predecessors, (90), 76 states have call successors, (90) [2022-10-15 16:32:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1807 transitions. [2022-10-15 16:32:33,205 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1807 transitions. Word has length 66 [2022-10-15 16:32:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:33,208 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1807 transitions. [2022-10-15 16:32:33,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1807 transitions. [2022-10-15 16:32:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 16:32:33,212 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:33,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 16:32:33,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:33,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-10-15 16:32:33,427 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash -693046305, now seen corresponding path program 1 times [2022-10-15 16:32:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557637424] [2022-10-15 16:32:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:32:33,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:32:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:32:33,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:32:33,542 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:32:33,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 16:32:33,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 16:32:33,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-10-15 16:32:33,550 INFO L444 BasicCegarLoop]: Path program 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] [2022-10-15 16:32:33,554 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:32:33,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:32:33 BoogieIcfgContainer [2022-10-15 16:32:33,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:32:33,621 INFO L158 Benchmark]: Toolchain (without parser) took 29756.91ms. Allocated memory was 156.2MB in the beginning and 436.2MB in the end (delta: 280.0MB). Free memory was 129.9MB in the beginning and 359.4MB in the end (delta: -229.5MB). Peak memory consumption was 51.3MB. Max. memory is 8.0GB. [2022-10-15 16:32:33,622 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 156.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:32:33,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.64ms. Allocated memory is still 156.2MB. Free memory was 129.7MB in the beginning and 115.7MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:32:33,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.65ms. Allocated memory is still 156.2MB. Free memory was 115.5MB in the beginning and 113.3MB in the end (delta: 2.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:32:33,622 INFO L158 Benchmark]: Boogie Preprocessor took 77.61ms. Allocated memory is still 156.2MB. Free memory was 113.3MB in the beginning and 111.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:32:33,623 INFO L158 Benchmark]: RCFGBuilder took 891.92ms. Allocated memory is still 156.2MB. Free memory was 111.4MB in the beginning and 127.2MB in the end (delta: -15.8MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2022-10-15 16:32:33,623 INFO L158 Benchmark]: TraceAbstraction took 28150.77ms. Allocated memory was 156.2MB in the beginning and 436.2MB in the end (delta: 280.0MB). Free memory was 126.1MB in the beginning and 359.4MB in the end (delta: -233.2MB). Peak memory consumption was 46.2MB. Max. memory is 8.0GB. [2022-10-15 16:32:33,627 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 156.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 511.64ms. Allocated memory is still 156.2MB. Free memory was 129.7MB in the beginning and 115.7MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 106.65ms. Allocated memory is still 156.2MB. Free memory was 115.5MB in the beginning and 113.3MB in the end (delta: 2.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.61ms. Allocated memory is still 156.2MB. Free memory was 113.3MB in the beginning and 111.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 891.92ms. Allocated memory is still 156.2MB. Free memory was 111.4MB in the beginning and 127.2MB in the end (delta: -15.8MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * TraceAbstraction took 28150.77ms. Allocated memory was 156.2MB in the beginning and 436.2MB in the end (delta: 280.0MB). Free memory was 126.1MB in the beginning and 359.4MB in the end (delta: -233.2MB). Peak memory consumption was 46.2MB. 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 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseComplement at line 76, overapproximation of memtrack at line 17. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-125, eb=127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L29] COND FALSE !(! m) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L57] COND TRUE 1 VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L78] __retres4 = res VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, \result=144115188075855871, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=144115188075855871, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L253] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, tmp=1, zero=0] [L263] sa = tmp VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L101] COND FALSE !(! b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L110] ma = ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L113] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=2, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L17] reach_error() VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] - UnprovableResult [Line: 225]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 28.0s, OverallIterations: 39, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7951 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7752 mSDsluCounter, 44316 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36952 mSDsCounter, 946 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9474 IncrementalHoareTripleChecker+Invalid, 10420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 946 mSolverCounterUnsat, 7364 mSDtfsCounter, 9474 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2113 GetRequests, 1602 SyntacticMatches, 40 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1434occurred in iteration=36, InterpolantAutomatonStates: 366, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 12772 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2957 NumberOfCodeBlocks, 2957 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3398 ConstructedInterpolants, 0 QuantifiedInterpolants, 9328 SizeOfPredicates, 88 NumberOfNonLiveVariables, 2679 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 63 InterpolantComputations, 30 PerfectInterpolantSequences, 931/1069 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:32:33,655 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...