/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-newlib/double_req_bl_0971.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-dev-05d3305-m
[2022-10-15 16:44:06,386 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-10-15 16:44:06,390 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-10-15 16:44:06,445 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-10-15 16:44:06,445 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-10-15 16:44:06,450 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-10-15 16:44:06,454 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-10-15 16:44:06,472 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-10-15 16:44:06,477 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-10-15 16:44:06,483 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-10-15 16:44:06,485 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-10-15 16:44:06,487 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-10-15 16:44:06,488 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-10-15 16:44:06,490 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-10-15 16:44:06,492 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-10-15 16:44:06,497 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-10-15 16:44:06,501 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-10-15 16:44:06,502 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-10-15 16:44:06,506 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-10-15 16:44:06,511 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-10-15 16:44:06,514 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-10-15 16:44:06,516 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-10-15 16:44:06,519 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-10-15 16:44:06,521 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-10-15 16:44:06,531 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-10-15 16:44:06,532 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-10-15 16:44:06,532 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-10-15 16:44:06,534 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-10-15 16:44:06,535 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-10-15 16:44:06,536 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-10-15 16:44:06,536 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-10-15 16:44:06,537 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-10-15 16:44:06,539 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-10-15 16:44:06,540 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-10-15 16:44:06,543 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-10-15 16:44:06,543 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-10-15 16:44:06,544 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-10-15 16:44:06,544 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-10-15 16:44:06,545 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-10-15 16:44:06,545 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-10-15 16:44:06,547 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-10-15 16:44:06,548 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2022-10-15 16:44:06,601 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-10-15 16:44:06,602 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-10-15 16:44:06,603 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-10-15 16:44:06,603 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-10-15 16:44:06,605 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-10-15 16:44:06,605 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-10-15 16:44:06,608 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-10-15 16:44:06,608 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-10-15 16:44:06,608 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-10-15 16:44:06,609 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-10-15 16:44:06,610 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-10-15 16:44:06,610 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2022-10-15 16:44:06,610 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-10-15 16:44:06,610 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-10-15 16:44:06,611 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-10-15 16:44:06,611 INFO  L138        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2022-10-15 16:44:06,611 INFO  L138        SettingsManager]:  * Bitprecise bitfields=true
[2022-10-15 16:44:06,611 INFO  L138        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2022-10-15 16:44:06,611 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-10-15 16:44:06,611 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2022-10-15 16:44:06,612 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-10-15 16:44:06,612 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-10-15 16:44:06,612 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-10-15 16:44:06,612 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-10-15 16:44:06,613 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-10-15 16:44:06,613 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-10-15 16:44:06,613 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-10-15 16:44:06,613 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-10-15 16:44:06,613 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-10-15 16:44:06,614 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-10-15 16:44:06,614 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2022-10-15 16:44:07,027 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-10-15 16:44:07,057 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-10-15 16:44:07,061 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-10-15 16:44:07,063 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-10-15 16:44:07,063 INFO  L275        PluginConnector]: CDTParser initialized
[2022-10-15 16:44:07,065 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0971.c
[2022-10-15 16:44:07,136 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dda680ab/d341197828324305b52ead8ae264d08f/FLAG71587db65
[2022-10-15 16:44:07,750 INFO  L306              CDTParser]: Found 1 translation units.
[2022-10-15 16:44:07,751 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0971.c
[2022-10-15 16:44:07,760 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dda680ab/d341197828324305b52ead8ae264d08f/FLAG71587db65
[2022-10-15 16:44:08,110 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dda680ab/d341197828324305b52ead8ae264d08f
[2022-10-15 16:44:08,116 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-10-15 16:44:08,125 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-10-15 16:44:08,130 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-10-15 16:44:08,130 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-10-15 16:44:08,135 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-10-15 16:44:08,136 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,138 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63217863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08, skipping insertion in model container
[2022-10-15 16:44:08,139 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,148 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-10-15 16:44:08,192 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-10-15 16:44:08,430 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-newlib/double_req_bl_0971.c[4582,4595]
[2022-10-15 16:44:08,435 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-10-15 16:44:08,457 INFO  L203         MainTranslator]: Completed pre-run
[2022-10-15 16:44:08,547 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-newlib/double_req_bl_0971.c[4582,4595]
[2022-10-15 16:44:08,548 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-10-15 16:44:08,568 INFO  L208         MainTranslator]: Completed translation
[2022-10-15 16:44:08,569 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08 WrapperNode
[2022-10-15 16:44:08,569 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-10-15 16:44:08,571 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-10-15 16:44:08,571 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-10-15 16:44:08,571 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-10-15 16:44:08,582 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,596 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,647 INFO  L138                Inliner]: procedures = 18, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 240
[2022-10-15 16:44:08,648 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-10-15 16:44:08,649 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-10-15 16:44:08,649 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-10-15 16:44:08,650 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-10-15 16:44:08,662 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,662 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,687 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,688 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,720 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,732 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,741 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,749 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,761 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-10-15 16:44:08,762 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-10-15 16:44:08,762 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-10-15 16:44:08,763 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-10-15 16:44:08,763 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (1/1) ...
[2022-10-15 16:44:08,772 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-10-15 16:44:08,787 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-15 16:44:08,803 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-10-15 16:44:08,811 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-10-15 16:44:08,869 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-10-15 16:44:08,870 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-10-15 16:44:08,870 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-10-15 16:44:08,870 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real
[2022-10-15 16:44:08,870 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-10-15 16:44:08,870 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real
[2022-10-15 16:44:08,871 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-10-15 16:44:08,871 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-10-15 16:44:08,871 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-10-15 16:44:08,871 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-10-15 16:44:09,015 INFO  L235             CfgBuilder]: Building ICFG
[2022-10-15 16:44:09,021 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-10-15 16:44:09,785 INFO  L276             CfgBuilder]: Performing block encoding
[2022-10-15 16:44:09,802 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-10-15 16:44:09,803 INFO  L300             CfgBuilder]: Removed 12 assume(true) statements.
[2022-10-15 16:44:09,809 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:09 BoogieIcfgContainer
[2022-10-15 16:44:09,810 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-10-15 16:44:09,815 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-10-15 16:44:09,816 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-10-15 16:44:09,825 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-10-15 16:44:09,825 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:44:08" (1/3) ...
[2022-10-15 16:44:09,826 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5b7e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:09, skipping insertion in model container
[2022-10-15 16:44:09,826 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:08" (2/3) ...
[2022-10-15 16:44:09,830 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5b7e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:09, skipping insertion in model container
[2022-10-15 16:44:09,830 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:09" (3/3) ...
[2022-10-15 16:44:09,834 INFO  L112   eAbstractionObserver]: Analyzing ICFG double_req_bl_0971.c
[2022-10-15 16:44:09,887 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-10-15 16:44:09,888 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations.
[2022-10-15 16:44:09,975 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-10-15 16:44:09,985 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;@69788c9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-10-15 16:44:09,985 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 34 error locations.
[2022-10-15 16:44:09,994 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 108 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 107 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:10,009 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2022-10-15 16:44:10,009 INFO  L187           NwaCegarLoop]: Found error trace
[2022-10-15 16:44:10,010 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2022-10-15 16:44:10,011 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] ===
[2022-10-15 16:44:10,017 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-15 16:44:10,017 INFO  L85        PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times
[2022-10-15 16:44:10,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-15 16:44:10,029 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869457602]
[2022-10-15 16:44:10,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-15 16:44:10,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-15 16:44:10,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-15 16:44:10,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-15 16:44:10,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-15 16:44:10,297 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869457602]
[2022-10-15 16:44:10,298 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869457602] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-15 16:44:10,298 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-15 16:44:10,299 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-10-15 16:44:10,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194652960]
[2022-10-15 16:44:10,302 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-15 16:44:10,307 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-10-15 16:44:10,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-15 16:44:10,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-10-15 16:44:10,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-15 16:44:10,352 INFO  L87              Difference]: Start difference. First operand  has 108 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 107 states have internal predecessors, (143), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:10,487 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-10-15 16:44:10,488 INFO  L93              Difference]: Finished difference Result 105 states and 125 transitions.
[2022-10-15 16:44:10,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-10-15 16:44:10,493 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4
[2022-10-15 16:44:10,493 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-10-15 16:44:10,508 INFO  L225             Difference]: With dead ends: 105
[2022-10-15 16:44:10,508 INFO  L226             Difference]: Without dead ends: 103
[2022-10-15 16:44:10,511 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-15 16:44:10,519 INFO  L413           NwaCegarLoop]: 118 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-10-15 16:44:10,520 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 194 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-10-15 16:44:10,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2022-10-15 16:44:10,577 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103.
[2022-10-15 16:44:10,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 102 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:10,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions.
[2022-10-15 16:44:10,590 INFO  L78                 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4
[2022-10-15 16:44:10,590 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-10-15 16:44:10,592 INFO  L495      AbstractCegarLoop]: Abstraction has 103 states and 123 transitions.
[2022-10-15 16:44:10,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:10,593 INFO  L276                IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions.
[2022-10-15 16:44:10,594 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2022-10-15 16:44:10,594 INFO  L187           NwaCegarLoop]: Found error trace
[2022-10-15 16:44:10,595 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2022-10-15 16:44:10,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-10-15 16:44:10,596 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] ===
[2022-10-15 16:44:10,598 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-15 16:44:10,599 INFO  L85        PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times
[2022-10-15 16:44:10,599 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-15 16:44:10,600 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081350811]
[2022-10-15 16:44:10,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-15 16:44:10,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-15 16:44:10,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-15 16:44:10,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-15 16:44:10,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-15 16:44:10,847 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081350811]
[2022-10-15 16:44:10,848 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081350811] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-15 16:44:10,848 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-15 16:44:10,848 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-10-15 16:44:10,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447935832]
[2022-10-15 16:44:10,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-15 16:44:10,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-10-15 16:44:10,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-15 16:44:10,851 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-10-15 16:44:10,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-15 16:44:10,852 INFO  L87              Difference]: Start difference. First operand 103 states and 123 transitions. Second operand  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:10,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-10-15 16:44:10,977 INFO  L93              Difference]: Finished difference Result 100 states and 120 transitions.
[2022-10-15 16:44:10,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-10-15 16:44:10,979 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4
[2022-10-15 16:44:10,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-10-15 16:44:10,983 INFO  L225             Difference]: With dead ends: 100
[2022-10-15 16:44:10,984 INFO  L226             Difference]: Without dead ends: 100
[2022-10-15 16:44:10,985 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-15 16:44:10,988 INFO  L413           NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-10-15 16:44:10,990 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-10-15 16:44:10,995 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2022-10-15 16:44:11,010 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100.
[2022-10-15 16:44:11,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 72 states have (on average 1.6666666666666667) internal successors, (120), 99 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:11,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions.
[2022-10-15 16:44:11,019 INFO  L78                 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 4
[2022-10-15 16:44:11,019 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-10-15 16:44:11,020 INFO  L495      AbstractCegarLoop]: Abstraction has 100 states and 120 transitions.
[2022-10-15 16:44:11,021 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:11,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions.
[2022-10-15 16:44:11,023 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-10-15 16:44:11,023 INFO  L187           NwaCegarLoop]: Found error trace
[2022-10-15 16:44:11,023 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-10-15 16:44:11,023 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-10-15 16:44:11,024 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] ===
[2022-10-15 16:44:11,027 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-15 16:44:11,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 830502709, now seen corresponding path program 1 times
[2022-10-15 16:44:11,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-15 16:44:11,028 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747677778]
[2022-10-15 16:44:11,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-15 16:44:11,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-15 16:44:11,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-15 16:44:11,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-15 16:44:11,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-15 16:44:11,226 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747677778]
[2022-10-15 16:44:11,227 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747677778] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-15 16:44:11,227 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-15 16:44:11,227 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-10-15 16:44:11,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954149142]
[2022-10-15 16:44:11,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-15 16:44:11,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-10-15 16:44:11,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-15 16:44:11,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-10-15 16:44:11,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-15 16:44:11,230 INFO  L87              Difference]: Start difference. First operand 100 states and 120 transitions. Second operand  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:11,316 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-10-15 16:44:11,316 INFO  L93              Difference]: Finished difference Result 98 states and 118 transitions.
[2022-10-15 16:44:11,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-10-15 16:44:11,317 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2022-10-15 16:44:11,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-10-15 16:44:11,318 INFO  L225             Difference]: With dead ends: 98
[2022-10-15 16:44:11,319 INFO  L226             Difference]: Without dead ends: 98
[2022-10-15 16:44:11,319 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-15 16:44:11,321 INFO  L413           NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-10-15 16:44:11,322 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-10-15 16:44:11,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2022-10-15 16:44:11,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2022-10-15 16:44:11,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 97 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:11,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions.
[2022-10-15 16:44:11,331 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 15
[2022-10-15 16:44:11,331 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-10-15 16:44:11,331 INFO  L495      AbstractCegarLoop]: Abstraction has 98 states and 118 transitions.
[2022-10-15 16:44:11,332 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:11,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions.
[2022-10-15 16:44:11,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-10-15 16:44:11,333 INFO  L187           NwaCegarLoop]: Found error trace
[2022-10-15 16:44:11,333 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-10-15 16:44:11,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-10-15 16:44:11,334 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] ===
[2022-10-15 16:44:11,334 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-15 16:44:11,335 INFO  L85        PathProgramCache]: Analyzing trace with hash 830502710, now seen corresponding path program 1 times
[2022-10-15 16:44:11,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-15 16:44:11,335 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777131201]
[2022-10-15 16:44:11,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-15 16:44:11,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-15 16:44:11,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-15 16:44:11,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-15 16:44:11,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-15 16:44:11,568 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777131201]
[2022-10-15 16:44:11,568 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777131201] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-15 16:44:11,568 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-15 16:44:11,569 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-10-15 16:44:11,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741747074]
[2022-10-15 16:44:11,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-15 16:44:11,570 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-10-15 16:44:11,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-15 16:44:11,570 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-10-15 16:44:11,571 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-15 16:44:11,571 INFO  L87              Difference]: Start difference. First operand 98 states and 118 transitions. Second operand  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:11,632 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-10-15 16:44:11,633 INFO  L93              Difference]: Finished difference Result 96 states and 116 transitions.
[2022-10-15 16:44:11,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-10-15 16:44:11,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2022-10-15 16:44:11,634 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-10-15 16:44:11,635 INFO  L225             Difference]: With dead ends: 96
[2022-10-15 16:44:11,635 INFO  L226             Difference]: Without dead ends: 96
[2022-10-15 16:44:11,635 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-15 16:44:11,637 INFO  L413           NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-10-15 16:44:11,638 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 193 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-10-15 16:44:11,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2022-10-15 16:44:11,644 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2022-10-15 16:44:11,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:11,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions.
[2022-10-15 16:44:11,646 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 15
[2022-10-15 16:44:11,646 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-10-15 16:44:11,647 INFO  L495      AbstractCegarLoop]: Abstraction has 96 states and 116 transitions.
[2022-10-15 16:44:11,647 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-10-15 16:44:11,647 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions.
[2022-10-15 16:44:11,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-10-15 16:44:11,648 INFO  L187           NwaCegarLoop]: Found error trace
[2022-10-15 16:44:11,648 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-10-15 16:44:11,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-10-15 16:44:11,649 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] ===
[2022-10-15 16:44:11,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-10-15 16:44:11,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 897698518, now seen corresponding path program 1 times
[2022-10-15 16:44:11,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-15 16:44:11,650 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039612856]
[2022-10-15 16:44:11,650 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-15 16:44:11,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-15 16:44:11,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-10-15 16:44:11,679 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-10-15 16:44:11,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-10-15 16:44:11,729 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-10-15 16:44:11,729 INFO  L359         BasicCegarLoop]: Counterexample is feasible
[2022-10-15 16:44:11,731 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (33 of 34 remaining)
[2022-10-15 16:44:11,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 34 remaining)
[2022-10-15 16:44:11,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 34 remaining)
[2022-10-15 16:44:11,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 34 remaining)
[2022-10-15 16:44:11,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 34 remaining)
[2022-10-15 16:44:11,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 34 remaining)
[2022-10-15 16:44:11,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 34 remaining)
[2022-10-15 16:44:11,736 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 34 remaining)
[2022-10-15 16:44:11,736 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 34 remaining)
[2022-10-15 16:44:11,736 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 34 remaining)
[2022-10-15 16:44:11,737 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 34 remaining)
[2022-10-15 16:44:11,737 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 34 remaining)
[2022-10-15 16:44:11,737 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 34 remaining)
[2022-10-15 16:44:11,738 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 34 remaining)
[2022-10-15 16:44:11,738 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 34 remaining)
[2022-10-15 16:44:11,738 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 34 remaining)
[2022-10-15 16:44:11,739 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 34 remaining)
[2022-10-15 16:44:11,739 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 34 remaining)
[2022-10-15 16:44:11,739 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 34 remaining)
[2022-10-15 16:44:11,739 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 34 remaining)
[2022-10-15 16:44:11,740 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 34 remaining)
[2022-10-15 16:44:11,740 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 34 remaining)
[2022-10-15 16:44:11,740 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 34 remaining)
[2022-10-15 16:44:11,741 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 34 remaining)
[2022-10-15 16:44:11,741 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 34 remaining)
[2022-10-15 16:44:11,741 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 34 remaining)
[2022-10-15 16:44:11,742 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 34 remaining)
[2022-10-15 16:44:11,742 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 34 remaining)
[2022-10-15 16:44:11,742 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 34 remaining)
[2022-10-15 16:44:11,743 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 34 remaining)
[2022-10-15 16:44:11,743 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 34 remaining)
[2022-10-15 16:44:11,743 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 34 remaining)
[2022-10-15 16:44:11,743 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 34 remaining)
[2022-10-15 16:44:11,744 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (0 of 34 remaining)
[2022-10-15 16:44:11,744 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-10-15 16:44:11,749 INFO  L444         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2022-10-15 16:44:11,760 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2022-10-15 16:44:11,814 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:44:11 BoogieIcfgContainer
[2022-10-15 16:44:11,814 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-10-15 16:44:11,815 INFO  L158              Benchmark]: Toolchain (without parser) took 3695.61ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 128.6MB in the beginning and 137.4MB in the end (delta: -8.8MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB.
[2022-10-15 16:44:11,816 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-10-15 16:44:11,816 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 439.88ms. Allocated memory is still 153.1MB. Free memory was 128.4MB in the beginning and 115.6MB in the end (delta: 12.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
[2022-10-15 16:44:11,817 INFO  L158              Benchmark]: Boogie Procedure Inliner took 77.39ms. Allocated memory is still 153.1MB. Free memory was 115.6MB in the beginning and 112.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-10-15 16:44:11,818 INFO  L158              Benchmark]: Boogie Preprocessor took 112.27ms. Allocated memory is still 153.1MB. Free memory was 112.7MB in the beginning and 110.4MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2022-10-15 16:44:11,818 INFO  L158              Benchmark]: RCFGBuilder took 1047.59ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 121.0MB in the end (delta: -10.7MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB.
[2022-10-15 16:44:11,819 INFO  L158              Benchmark]: TraceAbstraction took 1998.89ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 120.0MB in the beginning and 137.4MB in the end (delta: -17.4MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB.
[2022-10-15 16:44:11,822 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.22ms. Allocated memory is still 153.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 439.88ms. Allocated memory is still 153.1MB. Free memory was 128.4MB in the beginning and 115.6MB in the end (delta: 12.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 77.39ms. Allocated memory is still 153.1MB. Free memory was 115.6MB in the beginning and 112.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 112.27ms. Allocated memory is still 153.1MB. Free memory was 112.7MB in the beginning and 110.4MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 1047.59ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 121.0MB in the end (delta: -10.7MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB.
 * TraceAbstraction took 1998.89ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 120.0MB in the beginning and 137.4MB in the end (delta: -17.4MB). Peak memory consumption was 15.1MB. 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: 177]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryArithmeticDOUBLEoperation at line 147, overapproximation of memtrack at line 177. 
Possible FailurePath: 
[L19-L28]                static const double ln2_hi_log = 6.93147180369123816490e-01,
                    ln2_lo_log = 1.90821492927058770002e-10,
                    two54_log = 1.80143985094819840000e+16,
                    Lg1_log = 6.666666666666735130e-01,
                    Lg2_log = 3.999999999940941908e-01,
                    Lg3_log = 2.857142874366239149e-01,
                    Lg4_log = 2.222219843214978396e-01,
                    Lg5_log = 1.818357216161805012e-01,
                    Lg6_log = 1.531383769920937332e-01,
                    Lg7_log = 1.479819860511658591e-01;
[L30]                    static const double zero = 0.0;
[L113-L116]              static const double two54_log10 = 1.80143985094819840000e+16,
                    ivln10_log10 = 4.34294481903251816668e-01,
                    log10_2hi_log10 = 3.01029995663611771306e-01,
                    log10_2lo_log10 = 3.69423907715893078616e-13;
[L118]                   static const double zero_log10 = 0.0;
             VAL         [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0]
[L172]                   double x = 0.0 / 0.0;
[L173]       CALL, EXPR  __ieee754_log10(x)
[L121]                   double y, z;
[L122]                   __int32_t i, k, hx;
[L123]                   __uint32_t lx;
             VAL         [\old(x)=18014398509481993, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]
[L126]                   ieee_double_shape_type ew_u;
             VAL         [\old(x)=18014398509481993, ew_u={5:0}, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]
[L127]                   ew_u.value = (x)
             VAL         [\old(x)=18014398509481993, ew_u={5:0}, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]
[L128]       EXPR        ew_u.parts.msw
             VAL         [\old(x)=18014398509481993, ew_u={5:0}, ew_u.parts.msw=6441402368, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]
[L128]                   (hx) = ew_u.parts.msw
[L129]       EXPR        ew_u.parts.lsw
             VAL         [\old(x)=18014398509481993, ew_u={5:0}, ew_u.parts.lsw=18014398509481985, hx=2146435072, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]
[L129]                   (lx) = ew_u.parts.lsw
[L132]                   k = 0
             VAL         [\old(x)=18014398509481993, hx=2146435072, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=1, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]
[L133]       COND FALSE  !(hx < 0x00100000)
             VAL         [\old(x)=18014398509481993, hx=2146435072, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=1, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]
[L146]       COND TRUE   hx >= 0x7ff00000
[L147]                   return x + x;
             VAL         [\old(x)=18014398509481993, hx=2146435072, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=1, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]
[L173]       RET, EXPR   __ieee754_log10(x)
[L173]                   double res = __ieee754_log10(x);
[L176]       CALL, EXPR  isnan_double(res)
[L163]                   return x != x;
             VAL         [\old(x)=18014398509481994, \result=0, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481994, zero=0, zero_log10=0]
[L176]       RET, EXPR   isnan_double(res)
[L176]       COND TRUE   !isnan_double(res)
[L177]                   reach_error()
             VAL         [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, res=18014398509481994, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481993, zero=0, zero_log10=0]

  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -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: 165]: 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, 108 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 771 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 460 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 58 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2022-10-15 16:44:11,893 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...