/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 01:14:56,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:14:56,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:14:56,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:14:56,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:14:56,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:14:56,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:14:56,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:14:56,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:14:56,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:14:56,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:14:56,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:14:56,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:14:56,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:14:56,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:14:56,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:14:56,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:14:56,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:14:56,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:14:56,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:14:56,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:14:56,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:14:56,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:14:56,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:14:56,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:14:56,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:14:56,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:14:56,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:14:56,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:14:56,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:14:56,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:14:56,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:14:56,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:14:56,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:14:56,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:14:56,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:14:56,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:14:56,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:14:56,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:14:56,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:14:56,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:14:56,698 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-16 01:14:56,732 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:14:56,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:14:56,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:14:56,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:14:56,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:14:56,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:14:56,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:14:56,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:14:56,735 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:14:56,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:14:56,735 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:14:56,736 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:14:56,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:14:56,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:14:56,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:14:56,736 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:14:56,736 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:14:56,737 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:14:56,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:14:56,737 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:14:56,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:14:56,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:14:56,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:14:56,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:14:56,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:14:56,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:14:56,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:14:56,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:14:56,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:14:56,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:14:56,739 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-16 01:14:57,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:14:57,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:14:57,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:14:57,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:14:57,139 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:14:57,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-10-16 01:14:57,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668ad653d/24535d2810ca4742ae119b644b33ee1f/FLAG6b92edce8 [2022-10-16 01:14:57,852 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:14:57,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-10-16 01:14:57,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668ad653d/24535d2810ca4742ae119b644b33ee1f/FLAG6b92edce8 [2022-10-16 01:14:58,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668ad653d/24535d2810ca4742ae119b644b33ee1f [2022-10-16 01:14:58,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:14:58,195 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:14:58,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:14:58,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:14:58,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:14:58,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7829b183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58, skipping insertion in model container [2022-10-16 01:14:58,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:14:58,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:14:58,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2022-10-16 01:14:58,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:14:58,418 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:14:58,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2022-10-16 01:14:58,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:14:58,461 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:14:58,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58 WrapperNode [2022-10-16 01:14:58,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:14:58,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:14:58,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:14:58,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:14:58,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,508 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 98 [2022-10-16 01:14:58,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:14:58,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:14:58,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:14:58,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:14:58,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,535 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:14:58,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:14:58,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:14:58,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:14:58,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (1/1) ... [2022-10-16 01:14:58,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:14:58,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:14:58,575 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-16 01:14:58,577 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-16 01:14:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:14:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:14:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 01:14:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 01:14:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 01:14:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 01:14:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:14:58,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:14:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 01:14:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 01:14:58,724 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:14:58,726 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:14:58,994 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:14:59,001 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:14:59,002 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 01:14:59,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:14:59 BoogieIcfgContainer [2022-10-16 01:14:59,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:14:59,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:14:59,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:14:59,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:14:59,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:14:58" (1/3) ... [2022-10-16 01:14:59,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a3153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:14:59, skipping insertion in model container [2022-10-16 01:14:59,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:58" (2/3) ... [2022-10-16 01:14:59,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a3153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:14:59, skipping insertion in model container [2022-10-16 01:14:59,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:14:59" (3/3) ... [2022-10-16 01:14:59,015 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2022-10-16 01:14:59,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:14:59,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-10-16 01:14:59,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:14:59,122 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;@26a3aff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:14:59,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-10-16 01:14:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 38 states have internal predecessors, (47), 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-16 01:14:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:14:59,135 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:59,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:14:59,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:14:59,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash 889509678, now seen corresponding path program 1 times [2022-10-16 01:14:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:59,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100057052] [2022-10-16 01:14:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:59,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:59,350 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-16 01:14:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:59,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100057052] [2022-10-16 01:14:59,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100057052] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:59,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:59,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:14:59,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403007796] [2022-10-16 01:14:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:59,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:14:59,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:59,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:14:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:59,405 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:59,473 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-10-16 01:14:59,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:14:59,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 01:14:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:59,488 INFO L225 Difference]: With dead ends: 73 [2022-10-16 01:14:59,488 INFO L226 Difference]: Without dead ends: 69 [2022-10-16 01:14:59,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:59,498 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 38 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:59,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 89 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-16 01:14:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2022-10-16 01:14:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-10-16 01:14:59,555 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 6 [2022-10-16 01:14:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:59,555 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-10-16 01:14:59,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-10-16 01:14:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:14:59,558 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:59,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:14:59,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:14:59,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:14:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 889507752, now seen corresponding path program 1 times [2022-10-16 01:14:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:59,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730153350] [2022-10-16 01:14:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:59,715 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-16 01:14:59,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:59,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730153350] [2022-10-16 01:14:59,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730153350] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:59,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:59,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:14:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367561822] [2022-10-16 01:14:59,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:59,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:14:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:14:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:59,723 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:59,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:59,778 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-10-16 01:14:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:14:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 01:14:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:59,781 INFO L225 Difference]: With dead ends: 36 [2022-10-16 01:14:59,781 INFO L226 Difference]: Without dead ends: 36 [2022-10-16 01:14:59,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:59,783 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:59,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-16 01:14:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-16 01:14:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-10-16 01:14:59,794 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 6 [2022-10-16 01:14:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:59,796 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-10-16 01:14:59,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-10-16 01:14:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:14:59,797 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:59,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:14:59,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:14:59,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:14:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 889507753, now seen corresponding path program 1 times [2022-10-16 01:14:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:59,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718182605] [2022-10-16 01:14:59,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:59,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:15:00,029 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-16 01:15:00,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:15:00,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718182605] [2022-10-16 01:15:00,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718182605] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:15:00,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:15:00,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:15:00,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297469104] [2022-10-16 01:15:00,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:15:00,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:15:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:15:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:15:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:15:00,033 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:15:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:15:00,136 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-10-16 01:15:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 01:15:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 01:15:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:15:00,138 INFO L225 Difference]: With dead ends: 61 [2022-10-16 01:15:00,138 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 01:15:00,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:15:00,142 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 89 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:15:00,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 65 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:15:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 01:15:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 34. [2022-10-16 01:15:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 33 states have internal predecessors, (41), 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-16 01:15:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-10-16 01:15:00,158 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 6 [2022-10-16 01:15:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:15:00,158 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-10-16 01:15:00,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:15:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-10-16 01:15:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:15:00,159 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:15:00,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:15:00,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:15:00,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:15:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:15:00,163 INFO L85 PathProgramCache]: Analyzing trace with hash 891749769, now seen corresponding path program 1 times [2022-10-16 01:15:00,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:15:00,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080348519] [2022-10-16 01:15:00,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:15:00,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:15:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:15:00,213 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-16 01:15:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:15:00,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080348519] [2022-10-16 01:15:00,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080348519] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:15:00,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:15:00,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:15:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278101479] [2022-10-16 01:15:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:15:00,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:15:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:15:00,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:15:00,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:15:00,222 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:15:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:15:00,250 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-10-16 01:15:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:15:00,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 01:15:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:15:00,251 INFO L225 Difference]: With dead ends: 35 [2022-10-16 01:15:00,251 INFO L226 Difference]: Without dead ends: 34 [2022-10-16 01:15:00,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:15:00,254 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:15:00,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:15:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-16 01:15:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-10-16 01:15:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 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-16 01:15:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-10-16 01:15:00,260 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 6 [2022-10-16 01:15:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:15:00,261 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-10-16 01:15:00,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:15:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-10-16 01:15:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 01:15:00,262 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:15:00,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:15:00,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:15:00,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:15:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:15:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash -622790293, now seen corresponding path program 1 times [2022-10-16 01:15:00,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:15:00,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018368924] [2022-10-16 01:15:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:15:00,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:15:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:15:00,416 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-16 01:15:00,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:15:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018368924] [2022-10-16 01:15:00,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018368924] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:15:00,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:15:00,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:15:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937518801] [2022-10-16 01:15:00,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:15:00,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:15:00,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:15:00,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:15:00,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:15:00,422 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-16 01:15:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:15:00,466 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-10-16 01:15:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:15:00,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-10-16 01:15:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:15:00,468 INFO L225 Difference]: With dead ends: 30 [2022-10-16 01:15:00,469 INFO L226 Difference]: Without dead ends: 30 [2022-10-16 01:15:00,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:15:00,471 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:15:00,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:15:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-16 01:15:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-16 01:15:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 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-16 01:15:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-10-16 01:15:00,482 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 9 [2022-10-16 01:15:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:15:00,482 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-10-16 01:15:00,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-16 01:15:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-10-16 01:15:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 01:15:00,485 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:15:00,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:15:00,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:15:00,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:15:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:15:00,489 INFO L85 PathProgramCache]: Analyzing trace with hash -622790292, now seen corresponding path program 1 times [2022-10-16 01:15:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:15:00,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548474157] [2022-10-16 01:15:00,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:15:00,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:15:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:15:00,637 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-16 01:15:00,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:15:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548474157] [2022-10-16 01:15:00,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548474157] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:15:00,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:15:00,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:15:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57034288] [2022-10-16 01:15:00,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:15:00,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:15:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:15:00,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:15:00,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:15:00,641 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-16 01:15:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:15:00,663 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-10-16 01:15:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:15:00,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-10-16 01:15:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:15:00,664 INFO L225 Difference]: With dead ends: 27 [2022-10-16 01:15:00,664 INFO L226 Difference]: Without dead ends: 27 [2022-10-16 01:15:00,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:15:00,666 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:15:00,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:15:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-16 01:15:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-10-16 01:15:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-16 01:15:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-10-16 01:15:00,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 9 [2022-10-16 01:15:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:15:00,672 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-10-16 01:15:00,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-16 01:15:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-10-16 01:15:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 01:15:00,673 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:15:00,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:15:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 01:15:00,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:15:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:15:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash 708663045, now seen corresponding path program 1 times [2022-10-16 01:15:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:15:00,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18018614] [2022-10-16 01:15:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:15:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:15:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:15:00,755 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-16 01:15:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:15:00,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18018614] [2022-10-16 01:15:00,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18018614] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:15:00,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:15:00,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:15:00,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827815500] [2022-10-16 01:15:00,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:15:00,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:15:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:15:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:15:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:15:00,760 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:15:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:15:00,809 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-10-16 01:15:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 01:15:00,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-16 01:15:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:15:00,811 INFO L225 Difference]: With dead ends: 51 [2022-10-16 01:15:00,811 INFO L226 Difference]: Without dead ends: 51 [2022-10-16 01:15:00,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:15:00,813 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:15:00,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 81 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:15:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-16 01:15:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2022-10-16 01:15:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 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-16 01:15:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-10-16 01:15:00,825 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2022-10-16 01:15:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:15:00,825 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-10-16 01:15:00,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:15:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-10-16 01:15:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 01:15:00,830 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:15:00,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:15:00,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 01:15:00,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:15:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:15:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2133132438, now seen corresponding path program 1 times [2022-10-16 01:15:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:15:00,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647330141] [2022-10-16 01:15:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:15:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:15:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:15:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:15:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:15:00,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647330141] [2022-10-16 01:15:00,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647330141] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:15:00,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:15:00,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:15:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610217026] [2022-10-16 01:15:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:15:00,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:15:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:15:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:15:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:15:00,974 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-16 01:15:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:15:01,019 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-10-16 01:15:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:15:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-10-16 01:15:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:15:01,020 INFO L225 Difference]: With dead ends: 55 [2022-10-16 01:15:01,020 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 01:15:01,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 01:15:01,022 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 39 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:15:01,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 106 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:15:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 01:15:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 29. [2022-10-16 01:15:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 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-16 01:15:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-10-16 01:15:01,028 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2022-10-16 01:15:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:15:01,029 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-10-16 01:15:01,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-16 01:15:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-10-16 01:15:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 01:15:01,030 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:15:01,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:15:01,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 01:15:01,031 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:15:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:15:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1587533497, now seen corresponding path program 1 times [2022-10-16 01:15:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:15:01,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836019234] [2022-10-16 01:15:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:15:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:15:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:15:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 01:15:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:15:01,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836019234] [2022-10-16 01:15:01,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836019234] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:15:01,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:15:01,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:15:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019342748] [2022-10-16 01:15:01,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:15:01,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:15:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:15:01,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:15:01,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:15:01,293 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-16 01:15:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:15:01,320 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-10-16 01:15:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 01:15:01,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-10-16 01:15:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:15:01,322 INFO L225 Difference]: With dead ends: 29 [2022-10-16 01:15:01,322 INFO L226 Difference]: Without dead ends: 28 [2022-10-16 01:15:01,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:15:01,323 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:15:01,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:15:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-10-16 01:15:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-10-16 01:15:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-16 01:15:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-10-16 01:15:01,328 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2022-10-16 01:15:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:15:01,328 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-10-16 01:15:01,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-16 01:15:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-10-16 01:15:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 01:15:01,329 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:15:01,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:15:01,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 01:15:01,330 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:15:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:15:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1587533640, now seen corresponding path program 1 times [2022-10-16 01:15:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:15:01,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489186471] [2022-10-16 01:15:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:15:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:15:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:15:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 01:15:01,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:15:01,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489186471] [2022-10-16 01:15:01,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489186471] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:15:01,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:15:01,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:15:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740765908] [2022-10-16 01:15:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:15:01,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:15:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:15:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:15:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:15:01,451 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-16 01:15:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:15:01,484 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-10-16 01:15:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:15:01,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-10-16 01:15:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:15:01,485 INFO L225 Difference]: With dead ends: 53 [2022-10-16 01:15:01,485 INFO L226 Difference]: Without dead ends: 49 [2022-10-16 01:15:01,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 01:15:01,487 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:15:01,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 107 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:15:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-16 01:15:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2022-10-16 01:15:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-16 01:15:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-10-16 01:15:01,491 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 22 [2022-10-16 01:15:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:15:01,491 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-10-16 01:15:01,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-16 01:15:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-10-16 01:15:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 01:15:01,492 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:15:01,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:15:01,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 01:15:01,493 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-10-16 01:15:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:15:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1570522979, now seen corresponding path program 1 times [2022-10-16 01:15:01,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:15:01,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728092259] [2022-10-16 01:15:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:15:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:15:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:15:01,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 01:15:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:15:01,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 01:15:01,554 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 01:15:01,555 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2022-10-16 01:15:01,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2022-10-16 01:15:01,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2022-10-16 01:15:01,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2022-10-16 01:15:01,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2022-10-16 01:15:01,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2022-10-16 01:15:01,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2022-10-16 01:15:01,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2022-10-16 01:15:01,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2022-10-16 01:15:01,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2022-10-16 01:15:01,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2022-10-16 01:15:01,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (0 of 12 remaining) [2022-10-16 01:15:01,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 01:15:01,565 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:15:01,570 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 01:15:01,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:15:01 BoogieIcfgContainer [2022-10-16 01:15:01,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 01:15:01,613 INFO L158 Benchmark]: Toolchain (without parser) took 3422.75ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 137.9MB in the beginning and 101.2MB in the end (delta: 36.7MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2022-10-16 01:15:01,614 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 163.6MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:15:01,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.41ms. Allocated memory is still 163.6MB. Free memory was 137.7MB in the beginning and 127.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-16 01:15:01,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.43ms. Allocated memory is still 163.6MB. Free memory was 126.9MB in the beginning and 125.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 01:15:01,615 INFO L158 Benchmark]: Boogie Preprocessor took 30.20ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 123.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 01:15:01,615 INFO L158 Benchmark]: RCFGBuilder took 464.31ms. Allocated memory is still 163.6MB. Free memory was 123.8MB in the beginning and 110.4MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-16 01:15:01,616 INFO L158 Benchmark]: TraceAbstraction took 2605.72ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 109.8MB in the beginning and 101.2MB in the end (delta: 8.6MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. [2022-10-16 01:15:01,618 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.30ms. Allocated memory is still 163.6MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.41ms. Allocated memory is still 163.6MB. Free memory was 137.7MB in the beginning and 127.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.43ms. Allocated memory is still 163.6MB. Free memory was 126.9MB in the beginning and 125.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.20ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 123.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 464.31ms. Allocated memory is still 163.6MB. Free memory was 123.8MB in the beginning and 110.4MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2605.72ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 109.8MB in the beginning and 101.2MB in the end (delta: 8.6MB). Peak memory consumption was 43.5MB. 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: 96]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseAnd at line 45, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of memtrack at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of to_real at line 46. Possible FailurePath: [L1] int __return_main; [L17] double __return_104; VAL [__return_104=0, __return_main=0] [L20] double main__a; [L21] double main__r; [L22] main__a = __VERIFIER_nondet_double() [L23] int main____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0] [L24] COND TRUE main__a >= 20.0 VAL [__return_104=0, __return_main=0] [L26] COND TRUE main__a <= 30.0 [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_104=0, __return_main=0, main____CPAchecker_TMP_0=1] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] double __tmp_1; [L34] __tmp_1 = main__a [L35] double inv__A; [L36] inv__A = __tmp_1 [L37] double inv__xi; [L38] double inv__xsi; [L39] double inv__temp; [L40] signed int inv__cond; [L41] signed int inv__exp; [L42] union double_int inv__A_u; [L43] union double_int inv__xi_u; VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L44] inv__A_u.d = inv__A VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L45] EXPR inv__A_u.i VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__A_u.i=2145386497, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L45] inv__exp = ((signed int)(((inv__A_u.i) & 2146435072) >> 20)) - 1023 [L46] inv__xi_u.d = 1 VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__exp=-1023, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L47] inv__xi_u.i = (1023 - inv__exp) << 20 VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__exp=-1023, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L48] EXPR inv__xi_u.d VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__exp=-1023, inv__xi_u={4:0}, inv__xi_u.d=2145386512, main____CPAchecker_TMP_0=1, main__a=2145386509] [L48] inv__xi = inv__xi_u.d [L49] inv__cond = 1 VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L51] COND TRUE !(inv__cond == 0) [L53] inv__xsi = (2 * inv__xi) - ((inv__A * inv__xi) * inv__xi) [L54] inv__temp = inv__xsi - inv__xi [L55] int inv____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L56] COND FALSE !(inv__temp > 1.0E-10) VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={5:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L67] COND FALSE !(inv__temp < -1.0E-10) [L73] inv____CPAchecker_TMP_0 = 0 VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={5:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L61] inv__cond = inv____CPAchecker_TMP_0 [L62] inv__xi = inv__xsi VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={5:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={4:0}, inv__xsi=2145386510, main____CPAchecker_TMP_0=1, main__a=2145386509] [L51] COND FALSE !(!(inv__cond == 0)) [L80] __return_104 = inv__xi [L81] main__r = __return_104 [L82] int main____CPAchecker_TMP_1; VAL [__return_104=2145386510, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={5:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={4:0}, inv__xsi=2145386510, main____CPAchecker_TMP_0=1, main__a=2145386509, main__r=2145386510] [L83] COND FALSE !(main__r >= 0) VAL [__return_104=2145386510, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={5:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={4:0}, inv__xsi=2145386510, main____CPAchecker_TMP_0=1, main__a=2145386509, main__r=2145386510] [L108] main____CPAchecker_TMP_1 = 0 VAL [__return_104=2145386510, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={5:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={4:0}, inv__xsi=2145386510, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386509, main__r=2145386510] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_1 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__return_104=2145386510, __return_main=0, __tmp_1=2145386509, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={5:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={4:0}, inv__xsi=2145386510, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386509, main__r=2145386510] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_104=2145386510, __return_main=0, __tmp_1=2145386509, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={5:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={4:0}, inv__xsi=2145386510, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386509, main__r=2145386510] [L96] reach_error() VAL [__return_104=2145386510, __return_main=0, __tmp_1=2145386509, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={5:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={4:0}, inv__xsi=2145386510, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386509, main__r=2145386510] - 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: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 679 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 318 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 44, 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, 10 MinimizatonAttempts, 131 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3/3 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-16 01:15:01,667 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...