./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test07.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e03ee78d6fb8fed8d925fa146d2fbaeda58a8eee93c250fd17f0234d1b1c9cb7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:49:54,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:49:54,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:49:54,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:49:54,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:49:54,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:49:54,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:49:54,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:49:54,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:49:54,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:49:54,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:49:54,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:49:54,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:49:54,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:49:54,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:49:54,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:49:54,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:49:54,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:49:54,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:49:54,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:49:54,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:49:55,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:49:55,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:49:55,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:49:55,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:49:55,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:49:55,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:49:55,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:49:55,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:49:55,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:49:55,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:49:55,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:49:55,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:49:55,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:49:55,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:49:55,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:49:55,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:49:55,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:49:55,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:49:55,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:49:55,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:49:55,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:49:55,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:49:55,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:49:55,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:49:55,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:49:55,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:49:55,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:49:55,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:49:55,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:49:55,067 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:49:55,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:49:55,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:49:55,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:49:55,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:49:55,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:49:55,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:49:55,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:49:55,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:49:55,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:49:55,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:49:55,071 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:49:55,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:49:55,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:49:55,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:49:55,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:49:55,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:55,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:49:55,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:49:55,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:49:55,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:49:55,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:49:55,073 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:49:55,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:49:55,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:49:55,074 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e03ee78d6fb8fed8d925fa146d2fbaeda58a8eee93c250fd17f0234d1b1c9cb7 [2022-02-20 16:49:55,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:49:55,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:49:55,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:49:55,360 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:49:55,361 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:49:55,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test07.c [2022-02-20 16:49:55,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbf869dd/6c602c54d5804ca8ac390a6333ad00b1/FLAG5dd0f1c99 [2022-02-20 16:49:55,795 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:49:55,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test07.c [2022-02-20 16:49:55,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbf869dd/6c602c54d5804ca8ac390a6333ad00b1/FLAG5dd0f1c99 [2022-02-20 16:49:55,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbf869dd/6c602c54d5804ca8ac390a6333ad00b1 [2022-02-20 16:49:55,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:49:55,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:49:55,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:55,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:49:55,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:49:55,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354b9802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55, skipping insertion in model container [2022-02-20 16:49:55,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:49:55,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:49:56,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test07.c[578,591] [2022-02-20 16:49:56,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:56,018 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:49:56,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test07.c[578,591] [2022-02-20 16:49:56,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:56,050 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:49:56,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56 WrapperNode [2022-02-20 16:49:56,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:56,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:56,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:49:56,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:49:56,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,089 INFO L137 Inliner]: procedures = 12, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2022-02-20 16:49:56,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:56,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:49:56,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:49:56,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:49:56,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:49:56,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:49:56,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:49:56,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:49:56,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (1/1) ... [2022-02-20 16:49:56,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:56,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:49:56,157 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-02-20 16:49:56,164 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-02-20 16:49:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:49:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:49:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:49:56,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:49:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:49:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:49:56,251 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:49:56,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:49:56,368 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:49:56,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:49:56,373 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:49:56,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:56 BoogieIcfgContainer [2022-02-20 16:49:56,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:49:56,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:49:56,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:49:56,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:49:56,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:49:55" (1/3) ... [2022-02-20 16:49:56,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc0f6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:56, skipping insertion in model container [2022-02-20 16:49:56,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:56" (2/3) ... [2022-02-20 16:49:56,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc0f6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:56, skipping insertion in model container [2022-02-20 16:49:56,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:56" (3/3) ... [2022-02-20 16:49:56,388 INFO L111 eAbstractionObserver]: Analyzing ICFG test07.c [2022-02-20 16:49:56,393 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:49:56,393 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:49:56,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:49:56,469 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:49:56,470 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:49:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-02-20 16:49:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:49:56,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:56,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:49:56,507 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash 889508715, now seen corresponding path program 1 times [2022-02-20 16:49:56,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:56,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428509112] [2022-02-20 16:49:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:56,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:56,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {13#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(4, 4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(4, 5);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0; {13#true} is VALID [2022-02-20 16:49:56,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {13#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1, main_#t~post8#1, main_#t~ret9#1, main_#t~mem10#1;~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call main_#t~mem7#1 := read~int(~#a~0.base, ~#a~0.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;assume { :begin_inline_f } true;havoc f_#res#1;havoc f_#t~mem4#1, f_#t~mem5#1, f_#t~mem6#1, f_~v~0#1;call f_#t~mem4#1 := read~int(~p1~0.base, ~p1~0.offset, 4);call f_#t~mem5#1 := read~int(~p2~0.base, ~p2~0.offset, 4);call f_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset, 4);f_~v~0#1 := f_#t~mem4#1 + f_#t~mem5#1 - f_#t~mem6#1;havoc f_#t~mem4#1;havoc f_#t~mem5#1;havoc f_#t~mem6#1; {13#true} is VALID [2022-02-20 16:49:56,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {13#true} assume 1 == f_~v~0#1;~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset;f_#res#1 := f_~v~0#1; {15#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (<= 1 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 16:49:56,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {15#(and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (<= 1 |ULTIMATE.start_f_#res#1|))} main_#t~ret9#1 := f_#res#1;assume { :end_inline_f } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;call write~int(main_#t~ret9#1, ~#a~0.base, ~#a~0.offset, 4);havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(~#a~0.base, ~#a~0.offset, 4); {16#(and (= ~p2~0.offset ~p1~0.offset) (not (= |ULTIMATE.start_main_#t~mem10#1| 0)) (= ~p2~0.base ~p1~0.base))} is VALID [2022-02-20 16:49:56,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#(and (= ~p2~0.offset ~p1~0.offset) (not (= |ULTIMATE.start_main_#t~mem10#1| 0)) (= ~p2~0.base ~p1~0.base))} assume 0 == main_#t~mem10#1 || ~p1~0.base != ~p2~0.base || ~p1~0.offset != ~p2~0.offset;havoc main_#t~mem10#1; {14#false} is VALID [2022-02-20 16:49:56,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {14#false} assume !false; {14#false} is VALID [2022-02-20 16:49:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:56,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:56,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428509112] [2022-02-20 16:49:56,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428509112] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:56,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:56,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:49:56,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801439169] [2022-02-20 16:49:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:56,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:56,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:56,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:56,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:49:56,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:56,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:49:56,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:49:56,929 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,041 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 16:49:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:49:57,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-20 16:49:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-20 16:49:57,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-02-20 16:49:57,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:57,097 INFO L225 Difference]: With dead ends: 20 [2022-02-20 16:49:57,097 INFO L226 Difference]: Without dead ends: 7 [2022-02-20 16:49:57,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 16:49:57,104 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:57,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-02-20 16:49:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-20 16:49:57,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:57,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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-02-20 16:49:57,129 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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-02-20 16:49:57,130 INFO L87 Difference]: Start difference. First operand 7 states. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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-02-20 16:49:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,131 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2022-02-20 16:49:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2022-02-20 16:49:57,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:57,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:57,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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) Second operand 7 states. [2022-02-20 16:49:57,133 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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) Second operand 7 states. [2022-02-20 16:49:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,135 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2022-02-20 16:49:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2022-02-20 16:49:57,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:57,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:57,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:57,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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-02-20 16:49:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2022-02-20 16:49:57,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 6 [2022-02-20 16:49:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:57,144 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2022-02-20 16:49:57,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2022-02-20 16:49:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:49:57,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:57,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:49:57,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:49:57,147 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:57,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash 889568297, now seen corresponding path program 1 times [2022-02-20 16:49:57,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:57,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175062861] [2022-02-20 16:49:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:57,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {71#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(4, 4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(4, 5);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0; {73#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2022-02-20 16:49:57,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#(not (= |~#b~0.base| |~#a~0.base|))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem7#1, main_#t~post8#1, main_#t~ret9#1, main_#t~mem10#1;~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call main_#t~mem7#1 := read~int(~#a~0.base, ~#a~0.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;assume { :begin_inline_f } true;havoc f_#res#1;havoc f_#t~mem4#1, f_#t~mem5#1, f_#t~mem6#1, f_~v~0#1;call f_#t~mem4#1 := read~int(~p1~0.base, ~p1~0.offset, 4);call f_#t~mem5#1 := read~int(~p2~0.base, ~p2~0.offset, 4);call f_#t~mem6#1 := read~int(~#a~0.base, ~#a~0.offset, 4);f_~v~0#1 := f_#t~mem4#1 + f_#t~mem5#1 - f_#t~mem6#1;havoc f_#t~mem4#1;havoc f_#t~mem5#1;havoc f_#t~mem6#1; {74#(and (= (+ (- 1) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) 0) (not (<= |ULTIMATE.start_f_~v~0#1| 0)) (= (+ (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (* (- 1) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))) 0) (<= (+ (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) |ULTIMATE.start_f_~v~0#1|) (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))))} is VALID [2022-02-20 16:49:57,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {74#(and (= (+ (- 1) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset)) 0) (not (<= |ULTIMATE.start_f_~v~0#1| 0)) (= (+ (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (* (- 1) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))) 0) (<= (+ (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) |ULTIMATE.start_f_~v~0#1|) (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))))} assume !(1 == f_~v~0#1);f_#res#1 := 0; {72#false} is VALID [2022-02-20 16:49:57,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {72#false} main_#t~ret9#1 := f_#res#1;assume { :end_inline_f } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;call write~int(main_#t~ret9#1, ~#a~0.base, ~#a~0.offset, 4);havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(~#a~0.base, ~#a~0.offset, 4); {72#false} is VALID [2022-02-20 16:49:57,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {72#false} assume 0 == main_#t~mem10#1 || ~p1~0.base != ~p2~0.base || ~p1~0.offset != ~p2~0.offset;havoc main_#t~mem10#1; {72#false} is VALID [2022-02-20 16:49:57,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {72#false} assume !false; {72#false} is VALID [2022-02-20 16:49:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:57,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:57,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175062861] [2022-02-20 16:49:57,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175062861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:57,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:57,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:49:57,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451943393] [2022-02-20 16:49:57,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:57,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:57,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:57,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:49:57,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:57,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:49:57,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:49:57,409 INFO L87 Difference]: Start difference. First operand 7 states and 6 transitions. Second operand has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,443 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2022-02-20 16:49:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:49:57,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-20 16:49:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-20 16:49:57,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 6 transitions. [2022-02-20 16:49:57,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:57,454 INFO L225 Difference]: With dead ends: 7 [2022-02-20 16:49:57,454 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:49:57,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 16:49:57,455 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:57,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:49:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:49:57,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:57,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-20 16:49:57,458 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-20 16:49:57,458 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-20 16:49:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,458 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:49:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:49:57,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:57,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:57,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:49:57,459 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:49:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,459 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:49:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:49:57,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:57,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:57,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:57,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-20 16:49:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:49:57,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2022-02-20 16:49:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:57,461 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:49:57,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-02-20 16:49:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:49:57,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:57,464 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:49:57,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:49:57,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:49:57,482 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:49:57,483 INFO L854 garLoopResultBuilder]: At program point L32(lines 19 39) the Hoare annotation is: false [2022-02-20 16:49:57,483 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:49:57,483 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-02-20 16:49:57,483 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:49:57,484 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:49:57,484 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2022-02-20 16:49:57,484 INFO L854 garLoopResultBuilder]: At program point L15(lines 9 17) the Hoare annotation is: (and (= ~p2~0.offset ~p1~0.offset) (= ~p2~0.base ~p1~0.base) (<= 1 |ULTIMATE.start_f_#res#1|)) [2022-02-20 16:49:57,484 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 16) no Hoare annotation was computed. [2022-02-20 16:49:57,485 INFO L861 garLoopResultBuilder]: At program point L38(lines 19 39) the Hoare annotation is: true [2022-02-20 16:49:57,488 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:49:57,489 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:49:57,499 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:49:57,499 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:49:57,500 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:49:57,500 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:49:57,500 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:49:57,500 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:49:57,500 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:49:57,500 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 16:49:57,501 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:49:57,501 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:49:57,501 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:49:57,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:49:57 BoogieIcfgContainer [2022-02-20 16:49:57,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:49:57,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:49:57,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:49:57,512 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:49:57,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:56" (3/4) ... [2022-02-20 16:49:57,515 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:49:57,525 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 16:49:57,526 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:49:57,526 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:49:57,526 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:49:57,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (p2 == p1 && p2 == p1) && 1 <= \result [2022-02-20 16:49:57,572 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:49:57,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:49:57,573 INFO L158 Benchmark]: Toolchain (without parser) took 1760.18ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.6MB in the beginning and 67.0MB in the end (delta: -19.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:57,574 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:57,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.74ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 75.1MB in the end (delta: -27.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-20 16:49:57,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.47ms. Allocated memory is still 98.6MB. Free memory was 75.1MB in the beginning and 73.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:57,575 INFO L158 Benchmark]: Boogie Preprocessor took 35.91ms. Allocated memory is still 98.6MB. Free memory was 73.5MB in the beginning and 72.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:57,575 INFO L158 Benchmark]: RCFGBuilder took 247.55ms. Allocated memory is still 98.6MB. Free memory was 72.3MB in the beginning and 62.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:49:57,576 INFO L158 Benchmark]: TraceAbstraction took 1133.88ms. Allocated memory is still 98.6MB. Free memory was 61.4MB in the beginning and 69.6MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:57,576 INFO L158 Benchmark]: Witness Printer took 60.55ms. Allocated memory is still 98.6MB. Free memory was 69.6MB in the beginning and 67.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:57,578 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.74ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 75.1MB in the end (delta: -27.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.47ms. Allocated memory is still 98.6MB. Free memory was 75.1MB in the beginning and 73.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.91ms. Allocated memory is still 98.6MB. Free memory was 73.5MB in the beginning and 72.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 247.55ms. Allocated memory is still 98.6MB. Free memory was 72.3MB in the beginning and 62.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1133.88ms. Allocated memory is still 98.6MB. Free memory was 61.4MB in the beginning and 69.6MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.55ms. Allocated memory is still 98.6MB. Free memory was 69.6MB in the beginning and 67.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: 37]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 9 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 6 NumberOfFragments, 12 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 79 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: (p2 == p1 && p2 == p1) && 1 <= \result - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:49:57,622 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE