./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina1f.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/array-fpi/sina1f.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 c045faf818ba912986330d83ec4535586feb5762cd8fadcd48f247794f1235b8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:33:08,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:33:08,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:33:08,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:33:08,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:33:08,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:33:08,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:33:08,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:33:08,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:33:08,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:33:08,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:33:08,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:33:08,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:33:08,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:33:08,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:33:08,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:33:08,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:33:08,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:33:08,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:33:08,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:33:08,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:33:08,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:33:08,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:33:08,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:33:08,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:33:08,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:33:08,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:33:08,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:33:08,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:33:08,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:33:08,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:33:08,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:33:08,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:33:08,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:33:08,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:33:08,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:33:08,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:33:08,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:33:08,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:33:08,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:33:08,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:33:08,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:33:08,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:33:08,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:33:08,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:33:08,165 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:33:08,166 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:33:08,166 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:33:08,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:33:08,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:33:08,168 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:33:08,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:33:08,169 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:33:08,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:33:08,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:33:08,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:33:08,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:33:08,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:33:08,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:33:08,170 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:33:08,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:33:08,171 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:33:08,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:33:08,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:33:08,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:33:08,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:33:08,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:33:08,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:33:08,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:33:08,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:33:08,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:33:08,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:33:08,173 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:33:08,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:33:08,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:33:08,174 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 -> c045faf818ba912986330d83ec4535586feb5762cd8fadcd48f247794f1235b8 [2022-02-20 14:33:08,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:33:08,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:33:08,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:33:08,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:33:08,450 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:33:08,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina1f.c [2022-02-20 14:33:08,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d711281b4/7ab1c22c6ad648adb59f6824fdd5b786/FLAGbe55e077e [2022-02-20 14:33:08,898 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:33:08,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina1f.c [2022-02-20 14:33:08,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d711281b4/7ab1c22c6ad648adb59f6824fdd5b786/FLAGbe55e077e [2022-02-20 14:33:08,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d711281b4/7ab1c22c6ad648adb59f6824fdd5b786 [2022-02-20 14:33:08,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:33:08,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:33:08,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:33:08,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:33:08,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:33:08,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:33:08" (1/1) ... [2022-02-20 14:33:08,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a04679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:08, skipping insertion in model container [2022-02-20 14:33:08,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:33:08" (1/1) ... [2022-02-20 14:33:08,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:33:08,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:33:09,115 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/array-fpi/sina1f.c[589,602] [2022-02-20 14:33:09,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:33:09,144 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:33:09,154 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/array-fpi/sina1f.c[589,602] [2022-02-20 14:33:09,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:33:09,171 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:33:09,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09 WrapperNode [2022-02-20 14:33:09,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:33:09,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:33:09,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:33:09,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:33:09,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,203 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-02-20 14:33:09,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:33:09,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:33:09,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:33:09,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:33:09,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:33:09,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:33:09,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:33:09,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:33:09,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (1/1) ... [2022-02-20 14:33:09,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:33:09,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:33:09,281 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 14:33:09,303 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 14:33:09,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:33:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:33:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:33:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:33:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:33:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:33:09,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:33:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:33:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:33:09,388 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:33:09,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:33:09,582 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:33:09,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:33:09,587 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:33:09,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:33:09 BoogieIcfgContainer [2022-02-20 14:33:09,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:33:09,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:33:09,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:33:09,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:33:09,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:33:08" (1/3) ... [2022-02-20 14:33:09,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c8d998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:33:09, skipping insertion in model container [2022-02-20 14:33:09,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:33:09" (2/3) ... [2022-02-20 14:33:09,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c8d998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:33:09, skipping insertion in model container [2022-02-20 14:33:09,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:33:09" (3/3) ... [2022-02-20 14:33:09,595 INFO L111 eAbstractionObserver]: Analyzing ICFG sina1f.c [2022-02-20 14:33:09,599 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:33:09,600 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:33:09,660 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:33:09,669 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 14:33:09,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:33:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 14:33:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:33:09,693 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:33:09,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:33:09,695 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:33:09,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:33:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2022-02-20 14:33:09,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:33:09,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566148094] [2022-02-20 14:33:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:33:09,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:33:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:33:09,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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);~N~0 := 0; {24#true} is VALID [2022-02-20 14:33:09,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {24#true} is VALID [2022-02-20 14:33:09,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {24#true} is VALID [2022-02-20 14:33:09,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {25#false} is VALID [2022-02-20 14:33:09,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(4);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);main_~i~0#1 := 0; {25#false} is VALID [2022-02-20 14:33:09,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} assume !(main_~i~0#1 < ~N~0); {25#false} is VALID [2022-02-20 14:33:09,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} main_~i~0#1 := 0; {25#false} is VALID [2022-02-20 14:33:09,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !(main_~i~0#1 < ~N~0); {25#false} is VALID [2022-02-20 14:33:09,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} main_~i~0#1 := 0; {25#false} is VALID [2022-02-20 14:33:09,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25#false} is VALID [2022-02-20 14:33:09,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond#1; {25#false} is VALID [2022-02-20 14:33:09,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 14:33:09,869 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 14:33:09,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:33:09,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566148094] [2022-02-20 14:33:09,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566148094] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:33:09,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:33:09,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:33:09,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940303585] [2022-02-20 14:33:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:33:09,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:33:09,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:33:09,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:09,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:33:09,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:33:09,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:33:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:33:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:33:09,942 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:33:09,986 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-02-20 14:33:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:33:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:33:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:33:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 14:33:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 14:33:10,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2022-02-20 14:33:10,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:33:10,092 INFO L225 Difference]: With dead ends: 38 [2022-02-20 14:33:10,092 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 14:33:10,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:33:10,097 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:33:10,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:33:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 14:33:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 14:33:10,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:33:10,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 14:33:10,118 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 14:33:10,118 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 14:33:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:33:10,120 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-20 14:33:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 14:33:10,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:33:10,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:33:10,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 17 states. [2022-02-20 14:33:10,122 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 17 states. [2022-02-20 14:33:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:33:10,123 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-20 14:33:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 14:33:10,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:33:10,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:33:10,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:33:10,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:33:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 14:33:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-20 14:33:10,127 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-02-20 14:33:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:33:10,128 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-20 14:33:10,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 14:33:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:33:10,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:33:10,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:33:10,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:33:10,130 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:33:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:33:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2022-02-20 14:33:10,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:33:10,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684875677] [2022-02-20 14:33:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:33:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:33:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:33:10,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#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);~N~0 := 0; {128#true} is VALID [2022-02-20 14:33:10,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~post10#1, main_~i~0#1, main_~#sum~0#1.base, main_~#sum~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {128#true} is VALID [2022-02-20 14:33:10,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {130#(<= 1 ~N~0)} is VALID [2022-02-20 14:33:10,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {130#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {130#(<= 1 ~N~0)} is VALID [2022-02-20 14:33:10,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {130#(<= 1 ~N~0)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#sum~0#1.base, main_~#sum~0#1.offset := #Ultimate.allocOnStack(4);call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(1, main_~#sum~0#1.base, main_~#sum~0#1.offset, 4);main_~i~0#1 := 0; {131#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} is VALID [2022-02-20 14:33:10,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} assume !(main_~i~0#1 < ~N~0); {129#false} is VALID [2022-02-20 14:33:10,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {129#false} main_~i~0#1 := 0; {129#false} is VALID [2022-02-20 14:33:10,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {129#false} assume !(main_~i~0#1 < ~N~0); {129#false} is VALID [2022-02-20 14:33:10,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {129#false} main_~i~0#1 := 0; {129#false} is VALID [2022-02-20 14:33:10,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {129#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {129#false} is VALID [2022-02-20 14:33:10,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#false} assume 0 == __VERIFIER_assert_~cond#1; {129#false} is VALID [2022-02-20 14:33:10,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#false} assume !false; {129#false} is VALID [2022-02-20 14:33:10,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-02-20 14:33:10,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:33:10,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684875677] [2022-02-20 14:33:10,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684875677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:33:10,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:33:10,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:33:10,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861505135] [2022-02-20 14:33:10,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:33:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:33:10,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:33:10,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:10,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:33:10,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:33:10,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:33:10,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:33:10,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:33:10,255 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:33:10,361 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-02-20 14:33:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:33:10,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:33:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:33:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-02-20 14:33:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-02-20 14:33:10,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-02-20 14:33:10,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:33:10,438 INFO L225 Difference]: With dead ends: 37 [2022-02-20 14:33:10,438 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:33:10,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:33:10,439 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:33:10,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:33:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:33:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-02-20 14:33:10,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:33:10,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 14:33:10,477 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 14:33:10,477 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 14:33:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:33:10,482 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-20 14:33:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 14:33:10,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:33:10,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:33:10,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 27 states. [2022-02-20 14:33:10,484 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 27 states. [2022-02-20 14:33:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:33:10,487 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-20 14:33:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 14:33:10,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:33:10,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:33:10,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:33:10,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:33:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 14:33:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-20 14:33:10,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-02-20 14:33:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:33:10,494 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-20 14:33:10,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:33:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 14:33:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:33:10,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:33:10,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:33:10,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:33:10,498 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:33:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:33:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2022-02-20 14:33:10,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:33:10,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763035165] [2022-02-20 14:33:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:33:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:33:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:33:10,551 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 14:33:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 14:33:10,613 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 14:33:10,614 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 14:33:10,615 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:33:10,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:33:10,622 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 14:33:10,625 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:33:10,661 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:33:10,661 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:33:10,661 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:33:10,662 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 14:33:10,662 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 14:33:10,663 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:33:10,663 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:33:10,663 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:33:10,663 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 14:33:10,663 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:33:10,663 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:33:10,663 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-02-20 14:33:10,664 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2022-02-20 14:33:10,665 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:33:10,665 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 14:33:10,665 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:33:10,665 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 14:33:10,665 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2022-02-20 14:33:10,665 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 14:33:10,666 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:33:10,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:33:10 BoogieIcfgContainer [2022-02-20 14:33:10,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:33:10,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:33:10,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:33:10,667 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:33:10,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:33:09" (3/4) ... [2022-02-20 14:33:10,669 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 14:33:10,728 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:33:10,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:33:10,729 INFO L158 Benchmark]: Toolchain (without parser) took 1811.68ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 54.0MB in the beginning and 68.7MB in the end (delta: -14.6MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-02-20 14:33:10,730 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:33:10,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.11ms. Allocated memory is still 81.8MB. Free memory was 53.8MB in the beginning and 56.4MB in the end (delta: -2.6MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-02-20 14:33:10,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.65ms. Allocated memory is still 81.8MB. Free memory was 56.2MB in the beginning and 54.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:33:10,731 INFO L158 Benchmark]: Boogie Preprocessor took 39.36ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 53.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:33:10,731 INFO L158 Benchmark]: RCFGBuilder took 344.72ms. Allocated memory is still 81.8MB. Free memory was 53.2MB in the beginning and 41.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:33:10,732 INFO L158 Benchmark]: TraceAbstraction took 1076.40ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 40.8MB in the beginning and 72.1MB in the end (delta: -31.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:33:10,732 INFO L158 Benchmark]: Witness Printer took 61.39ms. Allocated memory is still 111.1MB. Free memory was 72.1MB in the beginning and 68.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 14:33:10,735 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.16ms. Allocated memory is still 81.8MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.11ms. Allocated memory is still 81.8MB. Free memory was 53.8MB in the beginning and 56.4MB in the end (delta: -2.6MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.65ms. Allocated memory is still 81.8MB. Free memory was 56.2MB in the beginning and 54.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.36ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 53.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.72ms. Allocated memory is still 81.8MB. Free memory was 53.2MB in the beginning and 41.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1076.40ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 40.8MB in the beginning and 72.1MB in the end (delta: -31.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.39ms. Allocated memory is still 111.1MB. Free memory was 72.1MB in the beginning and 68.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] int sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] sum[0] = 1 [L32] i=0 VAL [a={-1:0}, i=0, N=1, sum={5:0}] [L32] COND TRUE i