/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/ldv-regression/test21-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:57:47,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:57:47,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:57:47,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:57:47,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:57:47,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:57:47,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:57:47,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:57:47,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:57:47,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:57:47,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:57:47,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:57:47,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:57:47,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:57:47,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:57:47,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:57:47,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:57:47,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:57:47,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:57:47,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:57:47,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:57:47,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:57:47,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:57:47,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:57:47,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:57:47,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:57:47,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:57:47,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:57:47,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:57:47,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:57:47,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:57:47,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:57:47,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:57:47,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:57:47,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:57:47,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:57:47,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:57:47,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:57:47,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:57:47,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:57:47,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:57:47,590 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:57:47,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:57:47,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:57:47,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:57:47,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:57:47,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:57:47,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:57:47,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:57:47,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:57:47,625 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:57:47,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:57:47,626 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:57:47,626 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:57:47,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:57:47,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:57:47,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:57:47,627 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:57:47,627 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:57:47,627 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:57:47,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:57:47,628 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:57:47,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:57:47,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:57:47,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:57:47,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:57:47,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:57:47,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:47,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:57:47,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:57:47,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:57:47,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:57:47,630 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:57:48,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:57:48,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:57:48,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:57:48,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:57:48,097 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:57:48,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test21-2.c [2022-10-15 16:57:48,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb92cc59b/2806a8283ea4441eb08a401001151ab5/FLAG3fd290512 [2022-10-15 16:57:48,796 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:57:48,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test21-2.c [2022-10-15 16:57:48,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb92cc59b/2806a8283ea4441eb08a401001151ab5/FLAG3fd290512 [2022-10-15 16:57:49,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb92cc59b/2806a8283ea4441eb08a401001151ab5 [2022-10-15 16:57:49,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:57:49,168 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:57:49,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:49,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:57:49,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:57:49,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e08dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49, skipping insertion in model container [2022-10-15 16:57:49,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:57:49,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:57:49,462 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/ldv-regression/test21-2.c[892,905] [2022-10-15 16:57:49,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:49,478 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:57:49,498 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/ldv-regression/test21-2.c[892,905] [2022-10-15 16:57:49,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:49,517 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:57:49,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49 WrapperNode [2022-10-15 16:57:49,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:49,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:49,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:57:49,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:57:49,530 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:57:49" (1/1) ... [2022-10-15 16:57:49,541 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:57:49" (1/1) ... [2022-10-15 16:57:49,566 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2022-10-15 16:57:49,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:49,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:57:49,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:57:49,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:57:49,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,594 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:57:49,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:57:49,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:57:49,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:57:49,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (1/1) ... [2022-10-15 16:57:49,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:49,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:49,650 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:57:49,674 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:57:49,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:57:49,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:57:49,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:57:49,728 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-10-15 16:57:49,729 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-10-15 16:57:49,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:57:49,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:57:49,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:57:49,819 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:57:49,822 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:57:50,135 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:57:50,151 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:57:50,151 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 16:57:50,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:50 BoogieIcfgContainer [2022-10-15 16:57:50,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:57:50,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:57:50,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:57:50,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:57:50,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:57:49" (1/3) ... [2022-10-15 16:57:50,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15817819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:50, skipping insertion in model container [2022-10-15 16:57:50,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:49" (2/3) ... [2022-10-15 16:57:50,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15817819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:50, skipping insertion in model container [2022-10-15 16:57:50,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:50" (3/3) ... [2022-10-15 16:57:50,176 INFO L112 eAbstractionObserver]: Analyzing ICFG test21-2.c [2022-10-15 16:57:50,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:57:50,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-15 16:57:50,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:57:50,374 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;@44649f57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:57:50,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-15 16:57:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:57:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:57:50,401 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:50,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:57:50,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2022-10-15 16:57:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:50,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347148172] [2022-10-15 16:57:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:50,846 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:57:50,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:50,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347148172] [2022-10-15 16:57:50,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347148172] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:50,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:50,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:57:50,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998468210] [2022-10-15 16:57:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:50,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:50,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:50,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:50,901 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:57:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:50,964 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-10-15 16:57:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-15 16:57:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:50,977 INFO L225 Difference]: With dead ends: 42 [2022-10-15 16:57:50,977 INFO L226 Difference]: Without dead ends: 40 [2022-10-15 16:57:50,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:57:50,990 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:50,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:57:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-15 16:57:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-15 16:57:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.52) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:57:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-10-15 16:57:51,035 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 3 [2022-10-15 16:57:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:51,036 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-10-15 16:57:51,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:57:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-10-15 16:57:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:57:51,037 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:51,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:57:51,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:57:51,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:51,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2022-10-15 16:57:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:51,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760295870] [2022-10-15 16:57:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:51,225 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:57:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760295870] [2022-10-15 16:57:51,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760295870] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:51,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:51,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:57:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738522111] [2022-10-15 16:57:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:51,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:51,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:51,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:51,231 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:57:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:51,270 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-10-15 16:57:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-15 16:57:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:51,272 INFO L225 Difference]: With dead ends: 38 [2022-10-15 16:57:51,272 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 16:57:51,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:57:51,275 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:51,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:57:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 16:57:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 16:57:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.44) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:57:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-10-15 16:57:51,283 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 3 [2022-10-15 16:57:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:51,284 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-10-15 16:57:51,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:57:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-10-15 16:57:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:57:51,285 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:51,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:51,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:57:51,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash 549787499, now seen corresponding path program 1 times [2022-10-15 16:57:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:51,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882652669] [2022-10-15 16:57:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:51,390 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:57:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:51,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882652669] [2022-10-15 16:57:51,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882652669] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:51,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:51,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:57:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530511335] [2022-10-15 16:57:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:51,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:51,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:51,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:51,394 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:57:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:51,423 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-10-15 16:57:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-10-15 16:57:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:51,425 INFO L225 Difference]: With dead ends: 36 [2022-10-15 16:57:51,425 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 16:57:51,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:57:51,428 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:51,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:57:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 16:57:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 16:57:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.36) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:57:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-10-15 16:57:51,436 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 7 [2022-10-15 16:57:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:51,437 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-10-15 16:57:51,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:57:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-10-15 16:57:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:57:51,438 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:51,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:51,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:57:51,439 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:51,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash 549787500, now seen corresponding path program 1 times [2022-10-15 16:57:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:51,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503931716] [2022-10-15 16:57:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:51,632 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:57:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:51,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503931716] [2022-10-15 16:57:51,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503931716] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:51,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:51,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:57:51,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189763227] [2022-10-15 16:57:51,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:51,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:51,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:51,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:51,639 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:57:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:51,679 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-10-15 16:57:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-10-15 16:57:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:51,683 INFO L225 Difference]: With dead ends: 34 [2022-10-15 16:57:51,684 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 16:57:51,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:57:51,688 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:51,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 27 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:57:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 16:57:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 16:57:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:57:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-10-15 16:57:51,705 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 7 [2022-10-15 16:57:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:51,705 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-10-15 16:57:51,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:57:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-10-15 16:57:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:57:51,707 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:51,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:51,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:57:51,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash 797076057, now seen corresponding path program 1 times [2022-10-15 16:57:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:51,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994658645] [2022-10-15 16:57:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:52,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:52,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994658645] [2022-10-15 16:57:52,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994658645] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:52,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526037301] [2022-10-15 16:57:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:52,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:52,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:52,107 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:57:52,114 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:57:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:52,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 16:57:52,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:52,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:52,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526037301] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:52,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:52,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-10-15 16:57:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577323616] [2022-10-15 16:57:52,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:52,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-15 16:57:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:52,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-15 16:57:52,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:57:52,756 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-10-15 16:57:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:53,058 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-10-15 16:57:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:57:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2022-10-15 16:57:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:53,074 INFO L225 Difference]: With dead ends: 60 [2022-10-15 16:57:53,075 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 16:57:53,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:57:53,085 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 186 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:53,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 174 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 16:57:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2022-10-15 16:57:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-10-15 16:57:53,114 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 25 [2022-10-15 16:57:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:53,115 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-10-15 16:57:53,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-10-15 16:57:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-10-15 16:57:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:57:53,118 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:53,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:53,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 16:57:53,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:53,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:53,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash 797076058, now seen corresponding path program 1 times [2022-10-15 16:57:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:53,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711996873] [2022-10-15 16:57:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:53,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:53,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711996873] [2022-10-15 16:57:53,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711996873] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:53,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455416664] [2022-10-15 16:57:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:53,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:53,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:53,802 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:57:53,825 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:57:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-15 16:57:53,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:54,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:54,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455416664] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:54,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:54,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-10-15 16:57:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632880962] [2022-10-15 16:57:54,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:54,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-15 16:57:54,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-15 16:57:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-10-15 16:57:54,460 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 22 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 16:57:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:54,849 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-10-15 16:57:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:57:54,850 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 25 [2022-10-15 16:57:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:54,851 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:57:54,851 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 16:57:54,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:57:54,853 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 146 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:54,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 198 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 16:57:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-10-15 16:57:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-10-15 16:57:54,868 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 25 [2022-10-15 16:57:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:54,868 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-10-15 16:57:54,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.0) internal successors, (60), 19 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 16:57:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-10-15 16:57:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:57:54,870 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:54,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:54,915 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:57:55,071 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,SelfDestructingSolverStorable5 [2022-10-15 16:57:55,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash 210270043, now seen corresponding path program 1 times [2022-10-15 16:57:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:55,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402817073] [2022-10-15 16:57:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:55,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402817073] [2022-10-15 16:57:55,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402817073] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:55,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318673602] [2022-10-15 16:57:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:55,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:55,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:55,241 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:57:55,263 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:57:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:57:55,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:55,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:55,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318673602] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:55,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:55,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-10-15 16:57:55,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331361360] [2022-10-15 16:57:55,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:55,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 16:57:55,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:55,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 16:57:55,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2022-10-15 16:57:55,886 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 30 states, 27 states have (on average 2.259259259259259) internal successors, (61), 22 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 16:57:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:56,263 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-10-15 16:57:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:57:56,267 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.259259259259259) internal successors, (61), 22 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 25 [2022-10-15 16:57:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:56,270 INFO L225 Difference]: With dead ends: 58 [2022-10-15 16:57:56,270 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 16:57:56,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2022-10-15 16:57:56,274 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 57 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:56,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 607 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 16:57:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2022-10-15 16:57:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-10-15 16:57:56,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 25 [2022-10-15 16:57:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:56,298 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-10-15 16:57:56,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.259259259259259) internal successors, (61), 22 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 16:57:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-10-15 16:57:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:57:56,303 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:56,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:56,347 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:57:56,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:56,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:56,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1985277405, now seen corresponding path program 1 times [2022-10-15 16:57:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:56,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829872142] [2022-10-15 16:57:56,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:56,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:56,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:56,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:56,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829872142] [2022-10-15 16:57:56,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829872142] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:56,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513752080] [2022-10-15 16:57:56,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:56,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:56,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:56,648 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:57:56,670 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:57:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:56,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 16:57:56,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:56,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:56,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513752080] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:56,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:56,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-10-15 16:57:56,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720582172] [2022-10-15 16:57:56,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:56,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-15 16:57:56,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:56,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-15 16:57:56,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:57:56,963 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-10-15 16:57:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:57,237 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-10-15 16:57:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:57:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2022-10-15 16:57:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:57,239 INFO L225 Difference]: With dead ends: 60 [2022-10-15 16:57:57,240 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 16:57:57,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:57:57,241 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 105 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:57,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 338 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 16:57:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-10-15 16:57:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-10-15 16:57:57,248 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2022-10-15 16:57:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:57,249 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-10-15 16:57:57,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-10-15 16:57:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-10-15 16:57:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:57:57,250 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:57,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:57,297 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:57:57,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:57,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:57,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:57,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1985277406, now seen corresponding path program 1 times [2022-10-15 16:57:57,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:57,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51818580] [2022-10-15 16:57:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:57,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:57,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:57,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:57,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:57,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51818580] [2022-10-15 16:57:57,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51818580] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:57,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862081359] [2022-10-15 16:57:57,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:57,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:57,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:57,693 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:57:57,714 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:57:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:57,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-15 16:57:57,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:57,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:58,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862081359] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:58,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:58,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-10-15 16:57:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114925669] [2022-10-15 16:57:58,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:58,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-15 16:57:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-15 16:57:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:57:58,206 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 21 states, 20 states have (on average 3.0) internal successors, (60), 18 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 16:57:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:58,542 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-10-15 16:57:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:57:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 18 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 25 [2022-10-15 16:57:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:58,544 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:57:58,544 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 16:57:58,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-10-15 16:57:58,546 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 92 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:58,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 366 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 16:57:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-10-15 16:57:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-10-15 16:57:58,552 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2022-10-15 16:57:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:58,553 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-10-15 16:57:58,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 18 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 16:57:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-10-15 16:57:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:57:58,554 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:58,555 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:58,594 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:57:58,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:58,769 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:58,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1060446000, now seen corresponding path program 1 times [2022-10-15 16:57:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:58,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328559953] [2022-10-15 16:57:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:58,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328559953] [2022-10-15 16:57:58,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328559953] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:58,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:58,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:57:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648195743] [2022-10-15 16:57:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:58,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:57:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:58,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:57:58,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:58,904 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:59,020 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-10-15 16:57:59,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:57:59,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-10-15 16:57:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:59,021 INFO L225 Difference]: With dead ends: 58 [2022-10-15 16:57:59,021 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 16:57:59,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:57:59,023 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:59,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 89 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 16:57:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-10-15 16:57:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-10-15 16:57:59,030 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2022-10-15 16:57:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:59,030 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-10-15 16:57:59,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-10-15 16:57:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:57:59,032 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:59,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:59,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:57:59,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1060445999, now seen corresponding path program 1 times [2022-10-15 16:57:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:59,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351084515] [2022-10-15 16:57:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:59,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:59,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351084515] [2022-10-15 16:57:59,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351084515] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:59,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:59,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:57:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738264704] [2022-10-15 16:57:59,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:59,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:57:59,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:57:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:59,282 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:59,415 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-10-15 16:57:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:57:59,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-10-15 16:57:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:59,417 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:57:59,417 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:57:59,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:57:59,418 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:59,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 111 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:57:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2022-10-15 16:57:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-10-15 16:57:59,422 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 26 [2022-10-15 16:57:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:59,423 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-10-15 16:57:59,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-10-15 16:57:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:57:59,424 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:59,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:59,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:57:59,425 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1060430079, now seen corresponding path program 1 times [2022-10-15 16:57:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:59,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916667461] [2022-10-15 16:57:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:57:59,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:59,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916667461] [2022-10-15 16:57:59,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916667461] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:59,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:59,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:57:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608293759] [2022-10-15 16:57:59,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:59,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:59,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:59,479 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:59,492 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-10-15 16:57:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-10-15 16:57:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:59,496 INFO L225 Difference]: With dead ends: 42 [2022-10-15 16:57:59,496 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 16:57:59,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:57:59,497 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:59,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:57:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 16:57:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 16:57:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:57:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-10-15 16:57:59,506 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2022-10-15 16:57:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:59,507 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-10-15 16:57:59,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-10-15 16:57:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:57:59,510 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:59,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:59,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:57:59,510 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1869792626, now seen corresponding path program 1 times [2022-10-15 16:57:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596174690] [2022-10-15 16:57:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:59,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596174690] [2022-10-15 16:57:59,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596174690] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:59,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032861898] [2022-10-15 16:57:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:59,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:59,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:59,654 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:57:59,657 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:57:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:57:59,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:59,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:58:00,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032861898] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:00,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:00,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-10-15 16:58:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209708241] [2022-10-15 16:58:00,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:00,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 16:58:00,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:00,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 16:58:00,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2022-10-15 16:58:00,193 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 30 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 22 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 16:58:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:00,502 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-10-15 16:58:00,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:58:00,503 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 22 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2022-10-15 16:58:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:00,504 INFO L225 Difference]: With dead ends: 45 [2022-10-15 16:58:00,504 INFO L226 Difference]: Without dead ends: 43 [2022-10-15 16:58:00,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2022-10-15 16:58:00,505 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:00,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 303 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:58:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-15 16:58:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-10-15 16:58:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-15 16:58:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-10-15 16:58:00,510 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 26 [2022-10-15 16:58:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:00,510 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-10-15 16:58:00,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 22 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 16:58:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-10-15 16:58:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:58:00,512 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:00,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:00,553 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:58:00,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:00,726 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1414057420, now seen corresponding path program 1 times [2022-10-15 16:58:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:00,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058386205] [2022-10-15 16:58:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:58:00,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:00,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058386205] [2022-10-15 16:58:00,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058386205] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:00,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:00,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:58:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598449241] [2022-10-15 16:58:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:00,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:58:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:58:00,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:58:00,826 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:58:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:00,930 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-10-15 16:58:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:58:00,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-10-15 16:58:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:00,931 INFO L225 Difference]: With dead ends: 42 [2022-10-15 16:58:00,931 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 16:58:00,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:58:00,933 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:00,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 107 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 16:58:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-10-15 16:58:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-15 16:58:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-10-15 16:58:00,937 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 26 [2022-10-15 16:58:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:00,937 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-10-15 16:58:00,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:58:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-10-15 16:58:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:58:00,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:00,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:00,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:58:00,939 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:00,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:00,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1414057421, now seen corresponding path program 1 times [2022-10-15 16:58:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:00,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004349522] [2022-10-15 16:58:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:01,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:58:01,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:01,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004349522] [2022-10-15 16:58:01,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004349522] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:01,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:01,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:58:01,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850183432] [2022-10-15 16:58:01,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:01,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:58:01,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:01,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:58:01,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:58:01,132 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:58:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:01,264 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-10-15 16:58:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:58:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-10-15 16:58:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:01,266 INFO L225 Difference]: With dead ends: 41 [2022-10-15 16:58:01,266 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 16:58:01,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:58:01,267 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:01,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 115 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 16:58:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-10-15 16:58:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-15 16:58:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-10-15 16:58:01,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 26 [2022-10-15 16:58:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:01,272 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-10-15 16:58:01,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:58:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-10-15 16:58:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:58:01,273 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:01,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:01,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 16:58:01,274 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:01,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1412193287, now seen corresponding path program 1 times [2022-10-15 16:58:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:01,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563093825] [2022-10-15 16:58:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:58:01,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:58:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:58:01,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:58:01,340 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:58:01,341 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2022-10-15 16:58:01,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2022-10-15 16:58:01,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2022-10-15 16:58:01,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2022-10-15 16:58:01,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2022-10-15 16:58:01,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2022-10-15 16:58:01,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2022-10-15 16:58:01,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2022-10-15 16:58:01,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2022-10-15 16:58:01,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2022-10-15 16:58:01,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2022-10-15 16:58:01,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2022-10-15 16:58:01,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2022-10-15 16:58:01,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2022-10-15 16:58:01,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 16:58:01,351 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:01,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:58:01,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:58:01 BoogieIcfgContainer [2022-10-15 16:58:01,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:58:01,397 INFO L158 Benchmark]: Toolchain (without parser) took 12233.95ms. Allocated memory was 158.3MB in the beginning and 243.3MB in the end (delta: 84.9MB). Free memory was 134.0MB in the beginning and 120.4MB in the end (delta: 13.6MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. [2022-10-15 16:58:01,397 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 158.3MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:58:01,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.66ms. Allocated memory is still 158.3MB. Free memory was 133.8MB in the beginning and 123.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:58:01,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.80ms. Allocated memory is still 158.3MB. Free memory was 123.8MB in the beginning and 122.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:58:01,398 INFO L158 Benchmark]: Boogie Preprocessor took 29.87ms. Allocated memory is still 158.3MB. Free memory was 122.2MB in the beginning and 121.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:58:01,399 INFO L158 Benchmark]: RCFGBuilder took 557.25ms. Allocated memory is still 158.3MB. Free memory was 121.0MB in the beginning and 108.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 16:58:01,399 INFO L158 Benchmark]: TraceAbstraction took 11235.24ms. Allocated memory was 158.3MB in the beginning and 243.3MB in the end (delta: 84.9MB). Free memory was 107.7MB in the beginning and 120.4MB in the end (delta: -12.7MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. [2022-10-15 16:58:01,401 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.31ms. Allocated memory is still 158.3MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 344.66ms. Allocated memory is still 158.3MB. Free memory was 133.8MB in the beginning and 123.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.80ms. Allocated memory is still 158.3MB. Free memory was 123.8MB in the beginning and 122.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.87ms. Allocated memory is still 158.3MB. Free memory was 122.2MB in the beginning and 121.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 557.25ms. Allocated memory is still 158.3MB. Free memory was 121.0MB in the beginning and 108.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11235.24ms. Allocated memory was 158.3MB in the beginning and 243.3MB in the end (delta: 84.9MB). Free memory was 107.7MB in the beginning and 120.4MB in the end (delta: -12.7MB). Peak memory consumption was 73.3MB. 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: 44]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 44. Possible FailurePath: [L11] struct dummy d1, d2; VAL [d1={4:0}, d2={5:0}] [L34] CALL init() [L15] d1.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, d1={4:0}, d2={5:0}] [L16] d1.b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, d1={4:0}, d2={5:0}] [L18] d2.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, d1={4:0}, d2={5:0}] [L19] d2.b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, d1={4:0}, d2={5:0}] [L34] RET init() [L35] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L24] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={4:0}, d1={4:0}, d2={5:0}] [L24] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L35] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={4:0}] [L35] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L35] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L24] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={4:0}, d1={4:0}, d2={5:0}] [L24] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L35] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={4:0}, pd1={4:0}] [L35] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L36] COND TRUE pd1 != 0 && pd1 == pd2 [L37] CALL, EXPR check(pd1, pd2) [L29] EXPR s1->a VAL [d1={4:0}, d2={5:0}, s1={4:0}, s1={4:0}, s1->a=-1, s2={4:0}, s2={4:0}] [L29] EXPR s2->b VAL [d1={4:0}, d2={5:0}, s1={4:0}, s1={4:0}, s1->a=-1, s2={4:0}, s2={4:0}, s2->b=-2] [L29] return s1->a == s2->b; [L37] RET, EXPR check(pd1, pd2) [L37] COND TRUE !check(pd1, pd2) [L44] reach_error() VAL [d1={4:0}, d2={5:0}, pd1={4:0}, pd2={4:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 32]: 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 2 procedures, 44 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 977 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 2547 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2119 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2229 IncrementalHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 428 mSDtfsCounter, 2229 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 107, 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, 15 MinimizatonAttempts, 131 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 482 NumberOfCodeBlocks, 482 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 3966 SizeOfPredicates, 26 NumberOfNonLiveVariables, 948 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 27 InterpolantComputations, 9 PerfectInterpolantSequences, 32/92 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:58:01,454 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...