/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/float-benchs/Muller_Kahan.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:41:23,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:41:23,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:41:23,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:41:23,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:41:23,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:41:23,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:41:23,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:41:23,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:41:23,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:41:23,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:41:23,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:41:23,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:41:23,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:41:23,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:41:23,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:41:23,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:41:23,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:41:23,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:41:23,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:41:23,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:41:23,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:41:23,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:41:23,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:41:23,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:41:23,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:41:23,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:41:23,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:41:23,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:41:23,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:41:23,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:41:23,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:41:23,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:41:23,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:41:23,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:41:23,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:41:23,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:41:23,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:41:23,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:41:23,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:41:23,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:41:23,967 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:41:23,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:41:23,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:41:23,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:41:23,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:41:23,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:41:23,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:41:23,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:41:23,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:41:23,998 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:41:23,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:41:23,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:41:23,999 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:41:23,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:41:23,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:41:23,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:41:24,000 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:41:24,000 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:41:24,000 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:41:24,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:41:24,001 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:41:24,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:41:24,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:41:24,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:41:24,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:41:24,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:41:24,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:41:24,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:41:24,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:41:24,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:41:24,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:41:24,003 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:41:24,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:41:24,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:41:24,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:41:24,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:41:24,443 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:41:24,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2022-10-15 16:41:24,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f9431a7/7bb597f05231443aa4188881981a8b85/FLAG19ede6dac [2022-10-15 16:41:25,219 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:41:25,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2022-10-15 16:41:25,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f9431a7/7bb597f05231443aa4188881981a8b85/FLAG19ede6dac [2022-10-15 16:41:25,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f9431a7/7bb597f05231443aa4188881981a8b85 [2022-10-15 16:41:25,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:41:25,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:41:25,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:41:25,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:41:25,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:41:25,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef759a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25, skipping insertion in model container [2022-10-15 16:41:25,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:41:25,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:41:25,781 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/float-benchs/Muller_Kahan.c[631,644] [2022-10-15 16:41:25,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:41:25,820 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:41:25,839 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/float-benchs/Muller_Kahan.c[631,644] [2022-10-15 16:41:25,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:41:25,867 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:41:25,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25 WrapperNode [2022-10-15 16:41:25,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:41:25,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:41:25,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:41:25,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:41:25,884 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:41:25" (1/1) ... [2022-10-15 16:41:25,896 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:41:25" (1/1) ... [2022-10-15 16:41:25,924 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2022-10-15 16:41:25,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:41:25,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:41:25,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:41:25,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:41:25,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,972 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:41:25,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:41:25,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:41:25,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:41:25,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (1/1) ... [2022-10-15 16:41:25,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:41:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:41:26,039 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:41:26,059 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:41:26,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:41:26,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:41:26,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:41:26,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:41:26,227 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:41:26,230 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:41:26,423 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:41:26,437 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:41:26,437 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 16:41:26,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:41:26 BoogieIcfgContainer [2022-10-15 16:41:26,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:41:26,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:41:26,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:41:26,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:41:26,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:41:25" (1/3) ... [2022-10-15 16:41:26,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e9ac0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:41:26, skipping insertion in model container [2022-10-15 16:41:26,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:41:25" (2/3) ... [2022-10-15 16:41:26,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e9ac0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:41:26, skipping insertion in model container [2022-10-15 16:41:26,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:41:26" (3/3) ... [2022-10-15 16:41:26,450 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2022-10-15 16:41:26,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:41:26,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 16:41:26,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:41:26,557 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;@434d359a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:41:26,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 16:41:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:41:26,571 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:26,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:41:26,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:41:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-10-15 16:41:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:26,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241893865] [2022-10-15 16:41:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:26,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:26,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241893865] [2022-10-15 16:41:26,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241893865] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:41:26,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:41:26,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:41:26,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230808920] [2022-10-15 16:41:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:41:26,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:41:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:26,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:41:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:41:26,959 INFO L87 Difference]: Start difference. First operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:27,023 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-10-15 16:41:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:41:27,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 16:41:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:27,041 INFO L225 Difference]: With dead ends: 15 [2022-10-15 16:41:27,041 INFO L226 Difference]: Without dead ends: 13 [2022-10-15 16:41:27,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:41:27,056 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:27,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:41:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-10-15 16:41:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-10-15 16:41:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-10-15 16:41:27,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2022-10-15 16:41:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:27,106 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-10-15 16:41:27,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-10-15 16:41:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:41:27,109 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:27,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:27,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:41:27,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:41:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-10-15 16:41:27,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:27,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393983354] [2022-10-15 16:41:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:27,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393983354] [2022-10-15 16:41:27,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393983354] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:41:27,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314591039] [2022-10-15 16:41:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:41:27,255 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:41:27,280 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:41:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:27,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 16:41:27,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:41:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:27,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:41:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:27,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314591039] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:41:27,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:41:27,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-15 16:41:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933357866] [2022-10-15 16:41:27,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:41:27,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:41:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:41:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:41:27,435 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:27,462 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-10-15 16:41:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:41:27,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 16:41:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:27,464 INFO L225 Difference]: With dead ends: 18 [2022-10-15 16:41:27,464 INFO L226 Difference]: Without dead ends: 18 [2022-10-15 16:41:27,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:41:27,466 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:27,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 30 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:41:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-15 16:41:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-15 16:41:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-10-15 16:41:27,472 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2022-10-15 16:41:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:27,473 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-10-15 16:41:27,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-10-15 16:41:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:41:27,474 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:27,474 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:27,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 16:41:27,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:27,691 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:41:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:27,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2022-10-15 16:41:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:27,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128160210] [2022-10-15 16:41:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:27,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:27,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128160210] [2022-10-15 16:41:27,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128160210] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:41:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822687369] [2022-10-15 16:41:27,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:41:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:41:27,893 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:41:27,915 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:41:27,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:41:27,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:41:27,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 16:41:27,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:41:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:27,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:41:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:28,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822687369] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:41:28,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:41:28,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-10-15 16:41:28,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213998395] [2022-10-15 16:41:28,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:41:28,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:41:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:28,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:41:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:41:28,120 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:28,208 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-10-15 16:41:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 16:41:28,210 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:41:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:28,211 INFO L225 Difference]: With dead ends: 30 [2022-10-15 16:41:28,211 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 16:41:28,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:41:28,214 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:28,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 16:41:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-15 16:41:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-10-15 16:41:28,229 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 14 [2022-10-15 16:41:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:28,229 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-10-15 16:41:28,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-10-15 16:41:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:41:28,233 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:28,233 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:28,261 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:41:28,443 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,SelfDestructingSolverStorable2 [2022-10-15 16:41:28,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:41:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 3 times [2022-10-15 16:41:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:28,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147805313] [2022-10-15 16:41:28,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:28,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:28,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147805313] [2022-10-15 16:41:28,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147805313] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:41:28,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768240878] [2022-10-15 16:41:28,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 16:41:28,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:28,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:41:28,870 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:41:28,884 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:41:28,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-10-15 16:41:28,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:41:28,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:41:28,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:41:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:29,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:41:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:29,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768240878] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:41:29,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:41:29,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-10-15 16:41:29,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112242798] [2022-10-15 16:41:29,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:41:29,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 16:41:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:29,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 16:41:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-10-15 16:41:29,358 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:29,456 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-10-15 16:41:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-15 16:41:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-15 16:41:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:29,459 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:41:29,459 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:41:29,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-10-15 16:41:29,461 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:29,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 37 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:41:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:41:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-10-15 16:41:29,471 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 26 [2022-10-15 16:41:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:29,471 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-10-15 16:41:29,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-10-15 16:41:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-15 16:41:29,474 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:29,474 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:29,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 16:41:29,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:29,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:41:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970777, now seen corresponding path program 4 times [2022-10-15 16:41:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:29,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923113707] [2022-10-15 16:41:29,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:30,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:30,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923113707] [2022-10-15 16:41:30,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923113707] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:41:30,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835269640] [2022-10-15 16:41:30,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-15 16:41:30,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:30,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:41:30,526 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:41:30,536 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:41:30,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-15 16:41:30,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:41:30,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 16:41:30,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:41:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:30,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:41:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:31,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835269640] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:41:31,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:41:31,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-10-15 16:41:31,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566544827] [2022-10-15 16:41:31,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:41:31,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-10-15 16:41:31,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-10-15 16:41:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-10-15 16:41:31,633 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:31,804 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-10-15 16:41:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-10-15 16:41:31,804 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-10-15 16:41:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:31,806 INFO L225 Difference]: With dead ends: 102 [2022-10-15 16:41:31,807 INFO L226 Difference]: Without dead ends: 102 [2022-10-15 16:41:31,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-10-15 16:41:31,809 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:31,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 51 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:41:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-15 16:41:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-10-15 16:41:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.02) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2022-10-15 16:41:31,821 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 50 [2022-10-15 16:41:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:31,822 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2022-10-15 16:41:31,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-10-15 16:41:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-10-15 16:41:31,826 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:31,826 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:31,868 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:41:32,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:32,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:41:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -675115127, now seen corresponding path program 5 times [2022-10-15 16:41:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:32,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878527578] [2022-10-15 16:41:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:33,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:33,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878527578] [2022-10-15 16:41:33,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878527578] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:41:33,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260204462] [2022-10-15 16:41:33,965 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-15 16:41:33,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:33,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:41:33,967 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:41:33,985 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:41:34,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-10-15 16:41:34,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:41:34,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-15 16:41:34,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:41:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:34,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:41:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:37,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260204462] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:41:37,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:41:37,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-10-15 16:41:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050071550] [2022-10-15 16:41:37,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:41:37,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-10-15 16:41:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:37,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-10-15 16:41:37,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-10-15 16:41:37,340 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:37,741 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2022-10-15 16:41:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-10-15 16:41:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-10-15 16:41:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:37,754 INFO L225 Difference]: With dead ends: 198 [2022-10-15 16:41:37,754 INFO L226 Difference]: Without dead ends: 198 [2022-10-15 16:41:37,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-10-15 16:41:37,762 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 94 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:37,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 58 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:41:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-10-15 16:41:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-10-15 16:41:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 196 states have (on average 1.010204081632653) internal successors, (198), 197 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2022-10-15 16:41:37,779 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 98 [2022-10-15 16:41:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:37,780 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2022-10-15 16:41:37,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2022-10-15 16:41:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-10-15 16:41:37,786 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:37,787 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:37,820 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:41:38,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:38,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:41:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733719, now seen corresponding path program 6 times [2022-10-15 16:41:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:38,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360007449] [2022-10-15 16:41:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:38,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:41:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:45,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:41:45,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360007449] [2022-10-15 16:41:45,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360007449] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:41:45,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440037874] [2022-10-15 16:41:45,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-15 16:41:45,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:41:45,045 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:41:45,061 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:41:45,296 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2022-10-15 16:41:45,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:41:45,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 96 conjunts are in the unsatisfiable core [2022-10-15 16:41:45,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:41:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:45,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:41:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:41:50,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440037874] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:41:50,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:41:50,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2022-10-15 16:41:50,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659319806] [2022-10-15 16:41:50,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:41:50,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-10-15 16:41:50,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:41:50,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-10-15 16:41:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-10-15 16:41:50,049 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:41:50,381 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2022-10-15 16:41:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-15 16:41:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2022-10-15 16:41:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:41:50,384 INFO L225 Difference]: With dead ends: 210 [2022-10-15 16:41:50,384 INFO L226 Difference]: Without dead ends: 210 [2022-10-15 16:41:50,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 292 SyntacticMatches, 90 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4831 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-10-15 16:41:50,389 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:41:50,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 58 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:41:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-10-15 16:41:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-10-15 16:41:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 1.0096153846153846) internal successors, (210), 209 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2022-10-15 16:41:50,404 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 194 [2022-10-15 16:41:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:41:50,405 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2022-10-15 16:41:50,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:41:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2022-10-15 16:41:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-10-15 16:41:50,409 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:41:50,409 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1] [2022-10-15 16:41:50,447 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:41:50,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:41:50,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:41:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:41:50,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1785393291, now seen corresponding path program 7 times [2022-10-15 16:41:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:41:50,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172445610] [2022-10-15 16:41:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:41:50,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:41:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:41:50,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:41:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:41:50,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:41:50,910 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:41:50,912 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 16:41:50,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 16:41:50,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:41:50,923 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1] [2022-10-15 16:41:50,931 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:41:51,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:41:51 BoogieIcfgContainer [2022-10-15 16:41:51,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:41:51,125 INFO L158 Benchmark]: Toolchain (without parser) took 25537.97ms. Allocated memory was 151.0MB in the beginning and 330.3MB in the end (delta: 179.3MB). Free memory was 126.5MB in the beginning and 154.1MB in the end (delta: -27.6MB). Peak memory consumption was 151.9MB. Max. memory is 8.0GB. [2022-10-15 16:41:51,125 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:41:51,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.51ms. Allocated memory is still 151.0MB. Free memory was 126.3MB in the beginning and 116.2MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 16:41:51,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.39ms. Allocated memory is still 151.0MB. Free memory was 116.2MB in the beginning and 114.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:41:51,127 INFO L158 Benchmark]: Boogie Preprocessor took 54.76ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 113.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:41:51,127 INFO L158 Benchmark]: RCFGBuilder took 456.85ms. Allocated memory is still 151.0MB. Free memory was 113.5MB in the beginning and 104.7MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-15 16:41:51,128 INFO L158 Benchmark]: TraceAbstraction took 24682.37ms. Allocated memory was 151.0MB in the beginning and 330.3MB in the end (delta: 179.3MB). Free memory was 103.9MB in the beginning and 154.1MB in the end (delta: -50.2MB). Peak memory consumption was 129.9MB. Max. memory is 8.0GB. [2022-10-15 16:41:51,132 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.24ms. Allocated memory is still 151.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.51ms. Allocated memory is still 151.0MB. Free memory was 126.3MB in the beginning and 116.2MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.39ms. Allocated memory is still 151.0MB. Free memory was 116.2MB in the beginning and 114.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.76ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 113.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 456.85ms. Allocated memory is still 151.0MB. Free memory was 113.5MB in the beginning and 104.7MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 24682.37ms. Allocated memory was 151.0MB in the beginning and 330.3MB in the end (delta: 179.3MB). Free memory was 103.9MB in the beginning and 154.1MB in the end (delta: -50.2MB). Peak memory consumption was 129.9MB. 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: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 22, overapproximation of memtrack at line 12. Possible FailurePath: [L16] double x0, x1, x2; [L17] int i; [L19] x0 = 11. / 2. [L20] x1 = 61. / 11. [L21] i = 0 VAL [i=0] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=0, x0=192, x1=116, x2=116] [L21] i++ VAL [i=1, x0=192, x1=116, x2=116] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=1, x0=116, x1=126, x2=126] [L21] i++ VAL [i=2, x0=116, x1=126, x2=126] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=2, x0=126, x1=196, x2=196] [L21] i++ VAL [i=3, x0=126, x1=196, x2=196] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=3, x0=196, x1=137, x2=137] [L21] i++ VAL [i=4, x0=196, x1=137, x2=137] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=4, x0=137, x1=145, x2=145] [L21] i++ VAL [i=5, x0=137, x1=145, x2=145] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=5, x0=145, x1=149, x2=149] [L21] i++ VAL [i=6, x0=145, x1=149, x2=149] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=6, x0=149, x1=159, x2=159] [L21] i++ VAL [i=7, x0=149, x1=159, x2=159] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=7, x0=159, x1=202, x2=202] [L21] i++ VAL [i=8, x0=159, x1=202, x2=202] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=8, x0=202, x1=182, x2=182] [L21] i++ VAL [i=9, x0=202, x1=182, x2=182] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=9, x0=182, x1=204, x2=204] [L21] i++ VAL [i=10, x0=182, x1=204, x2=204] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=10, x0=204, x1=176, x2=176] [L21] i++ VAL [i=11, x0=204, x1=176, x2=176] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=11, x0=176, x1=153, x2=153] [L21] i++ VAL [i=12, x0=176, x1=153, x2=153] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=12, x0=153, x1=198, x2=198] [L21] i++ VAL [i=13, x0=153, x1=198, x2=198] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=13, x0=198, x1=134, x2=134] [L21] i++ VAL [i=14, x0=198, x1=134, x2=134] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=14, x0=134, x1=177, x2=177] [L21] i++ VAL [i=15, x0=134, x1=177, x2=177] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=15, x0=177, x1=125, x2=125] [L21] i++ VAL [i=16, x0=177, x1=125, x2=125] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=16, x0=125, x1=147, x2=147] [L21] i++ VAL [i=17, x0=125, x1=147, x2=147] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=17, x0=147, x1=169, x2=169] [L21] i++ VAL [i=18, x0=147, x1=169, x2=169] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=18, x0=169, x1=197, x2=197] [L21] i++ VAL [i=19, x0=169, x1=197, x2=197] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=19, x0=197, x1=160, x2=160] [L21] i++ VAL [i=20, x0=197, x1=160, x2=160] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=20, x0=160, x1=172, x2=172] [L21] i++ VAL [i=21, x0=160, x1=172, x2=172] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=21, x0=172, x1=155, x2=155] [L21] i++ VAL [i=22, x0=172, x1=155, x2=155] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=22, x0=155, x1=138, x2=138] [L21] i++ VAL [i=23, x0=155, x1=138, x2=138] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=23, x0=138, x1=151, x2=151] [L21] i++ VAL [i=24, x0=138, x1=151, x2=151] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=24, x0=151, x1=194, x2=194] [L21] i++ VAL [i=25, x0=151, x1=194, x2=194] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=25, x0=194, x1=168, x2=168] [L21] i++ VAL [i=26, x0=194, x1=168, x2=168] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=26, x0=168, x1=142, x2=142] [L21] i++ VAL [i=27, x0=168, x1=142, x2=142] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=27, x0=142, x1=183, x2=183] [L21] i++ VAL [i=28, x0=142, x1=183, x2=183] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=28, x0=183, x1=148, x2=148] [L21] i++ VAL [i=29, x0=183, x1=148, x2=148] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=29, x0=148, x1=119, x2=119] [L21] i++ VAL [i=30, x0=148, x1=119, x2=119] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=30, x0=119, x1=123, x2=123] [L21] i++ VAL [i=31, x0=119, x1=123, x2=123] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=31, x0=123, x1=154, x2=154] [L21] i++ VAL [i=32, x0=123, x1=154, x2=154] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=32, x0=154, x1=200, x2=200] [L21] i++ VAL [i=33, x0=154, x1=200, x2=200] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=33, x0=200, x1=140, x2=140] [L21] i++ VAL [i=34, x0=200, x1=140, x2=140] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=34, x0=140, x1=109, x2=109] [L21] i++ VAL [i=35, x0=140, x1=109, x2=109] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=35, x0=109, x1=189, x2=189] [L21] i++ VAL [i=36, x0=109, x1=189, x2=189] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=36, x0=189, x1=106, x2=106] [L21] i++ VAL [i=37, x0=189, x1=106, x2=106] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=37, x0=106, x1=178, x2=178] [L21] i++ VAL [i=38, x0=106, x1=178, x2=178] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=38, x0=178, x1=124, x2=124] [L21] i++ VAL [i=39, x0=178, x1=124, x2=124] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=39, x0=124, x1=156, x2=156] [L21] i++ VAL [i=40, x0=124, x1=156, x2=156] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=40, x0=156, x1=180, x2=180] [L21] i++ VAL [i=41, x0=156, x1=180, x2=180] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=41, x0=180, x1=115, x2=115] [L21] i++ VAL [i=42, x0=180, x1=115, x2=115] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=42, x0=115, x1=131, x2=131] [L21] i++ VAL [i=43, x0=115, x1=131, x2=131] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=43, x0=131, x1=188, x2=188] [L21] i++ VAL [i=44, x0=131, x1=188, x2=188] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=44, x0=188, x1=128, x2=128] [L21] i++ VAL [i=45, x0=188, x1=128, x2=128] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=45, x0=128, x1=121, x2=121] [L21] i++ VAL [i=46, x0=128, x1=121, x2=121] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=46, x0=121, x1=205, x2=205] [L21] i++ VAL [i=47, x0=121, x1=205, x2=205] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=47, x0=205, x1=146, x2=146] [L21] i++ VAL [i=48, x0=205, x1=146, x2=146] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=48, x0=146, x1=184, x2=184] [L21] i++ VAL [i=49, x0=146, x1=184, x2=184] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=49, x0=184, x1=150, x2=150] [L21] i++ VAL [i=50, x0=184, x1=150, x2=150] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=50, x0=150, x1=107, x2=107] [L21] i++ VAL [i=51, x0=150, x1=107, x2=107] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=51, x0=107, x1=174, x2=174] [L21] i++ VAL [i=52, x0=107, x1=174, x2=174] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=52, x0=174, x1=122, x2=122] [L21] i++ VAL [i=53, x0=174, x1=122, x2=122] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=53, x0=122, x1=193, x2=193] [L21] i++ VAL [i=54, x0=122, x1=193, x2=193] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=54, x0=193, x1=129, x2=129] [L21] i++ VAL [i=55, x0=193, x1=129, x2=129] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=55, x0=129, x1=191, x2=191] [L21] i++ VAL [i=56, x0=129, x1=191, x2=191] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=56, x0=191, x1=127, x2=127] [L21] i++ VAL [i=57, x0=191, x1=127, x2=127] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=57, x0=127, x1=139, x2=139] [L21] i++ VAL [i=58, x0=127, x1=139, x2=139] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=58, x0=139, x1=118, x2=118] [L21] i++ VAL [i=59, x0=139, x1=118, x2=118] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=59, x0=118, x1=166, x2=166] [L21] i++ VAL [i=60, x0=118, x1=166, x2=166] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=60, x0=166, x1=199, x2=199] [L21] i++ VAL [i=61, x0=166, x1=199, x2=199] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=61, x0=199, x1=158, x2=158] [L21] i++ VAL [i=62, x0=199, x1=158, x2=158] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=62, x0=158, x1=143, x2=143] [L21] i++ VAL [i=63, x0=158, x1=143, x2=143] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=63, x0=143, x1=173, x2=173] [L21] i++ VAL [i=64, x0=143, x1=173, x2=173] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=64, x0=173, x1=185, x2=185] [L21] i++ VAL [i=65, x0=173, x1=185, x2=185] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=65, x0=185, x1=190, x2=190] [L21] i++ VAL [i=66, x0=185, x1=190, x2=190] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=66, x0=190, x1=170, x2=170] [L21] i++ VAL [i=67, x0=190, x1=170, x2=170] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=67, x0=170, x1=161, x2=161] [L21] i++ VAL [i=68, x0=170, x1=161, x2=161] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=68, x0=161, x1=141, x2=141] [L21] i++ VAL [i=69, x0=161, x1=141, x2=141] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=69, x0=141, x1=133, x2=133] [L21] i++ VAL [i=70, x0=141, x1=133, x2=133] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=70, x0=133, x1=179, x2=179] [L21] i++ VAL [i=71, x0=133, x1=179, x2=179] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=71, x0=179, x1=201, x2=201] [L21] i++ VAL [i=72, x0=179, x1=201, x2=201] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=72, x0=201, x1=105, x2=105] [L21] i++ VAL [i=73, x0=201, x1=105, x2=105] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=73, x0=105, x1=152, x2=152] [L21] i++ VAL [i=74, x0=105, x1=152, x2=152] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=74, x0=152, x1=110, x2=110] [L21] i++ VAL [i=75, x0=152, x1=110, x2=110] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=75, x0=110, x1=165, x2=165] [L21] i++ VAL [i=76, x0=110, x1=165, x2=165] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=76, x0=165, x1=171, x2=171] [L21] i++ VAL [i=77, x0=165, x1=171, x2=171] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=77, x0=171, x1=175, x2=175] [L21] i++ VAL [i=78, x0=171, x1=175, x2=175] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=78, x0=175, x1=117, x2=117] [L21] i++ VAL [i=79, x0=175, x1=117, x2=117] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=79, x0=117, x1=113, x2=113] [L21] i++ VAL [i=80, x0=117, x1=113, x2=113] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=80, x0=113, x1=144, x2=144] [L21] i++ VAL [i=81, x0=113, x1=144, x2=144] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=81, x0=144, x1=203, x2=203] [L21] i++ VAL [i=82, x0=144, x1=203, x2=203] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=82, x0=203, x1=186, x2=186] [L21] i++ VAL [i=83, x0=203, x1=186, x2=186] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=83, x0=186, x1=135, x2=135] [L21] i++ VAL [i=84, x0=186, x1=135, x2=135] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=84, x0=135, x1=181, x2=181] [L21] i++ VAL [i=85, x0=135, x1=181, x2=181] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=85, x0=181, x1=114, x2=114] [L21] i++ VAL [i=86, x0=181, x1=114, x2=114] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=86, x0=114, x1=163, x2=163] [L21] i++ VAL [i=87, x0=114, x1=163, x2=163] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=87, x0=163, x1=164, x2=164] [L21] i++ VAL [i=88, x0=163, x1=164, x2=164] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=88, x0=164, x1=120, x2=120] [L21] i++ VAL [i=89, x0=164, x1=120, x2=120] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=89, x0=120, x1=132, x2=132] [L21] i++ VAL [i=90, x0=120, x1=132, x2=132] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=90, x0=132, x1=136, x2=136] [L21] i++ VAL [i=91, x0=132, x1=136, x2=136] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=91, x0=136, x1=187, x2=187] [L21] i++ VAL [i=92, x0=136, x1=187, x2=187] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=92, x0=187, x1=130, x2=130] [L21] i++ VAL [i=93, x0=187, x1=130, x2=130] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=93, x0=130, x1=111, x2=111] [L21] i++ VAL [i=94, x0=130, x1=111, x2=111] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=94, x0=111, x1=108, x2=108] [L21] i++ VAL [i=95, x0=111, x1=108, x2=108] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=95, x0=108, x1=112, x2=112] [L21] i++ VAL [i=96, x0=108, x1=112, x2=112] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=96, x0=112, x1=162, x2=162] [L21] i++ VAL [i=97, x0=112, x1=162, x2=162] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=97, x0=162, x1=195, x2=195] [L21] i++ VAL [i=98, x0=162, x1=195, x2=195] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=98, x0=195, x1=157, x2=157] [L21] i++ VAL [i=99, x0=195, x1=157, x2=157] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=99, x0=157, x1=167, x2=167] [L21] i++ VAL [i=100, x0=157, x1=167, x2=167] [L21] COND FALSE !(i < 100) VAL [i=100, x0=157, x1=167, x2=167] [L27] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 14]: 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 1 procedures, 13 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 8, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 65 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 593 SyntacticMatches, 90 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=7, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 1157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1455 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34659 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:41:51,196 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...