./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/loopv2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/loops-crafted-1/loopv2.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 68654c5c5ca49f0f291b56dff0b35b602882e8f2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:12:22,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:12:22,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:12:22,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:12:22,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:12:22,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:12:22,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:12:22,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:12:22,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:12:22,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:12:22,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:12:22,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:12:22,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:12:22,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:12:22,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:12:22,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:12:22,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:12:22,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:12:22,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:12:22,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:12:22,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:12:22,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:12:22,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:12:22,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:12:22,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:12:22,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:12:22,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:12:22,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:12:22,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:12:22,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:12:22,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:12:22,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:12:22,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:12:22,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:12:22,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:12:22,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:12:22,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:12:22,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:12:22,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:12:22,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:12:22,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:12:22,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:12:22,259 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:12:22,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:12:22,260 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:12:22,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:12:22,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:12:22,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:12:22,262 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:12:22,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:12:22,263 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:12:22,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:12:22,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:12:22,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:12:22,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:12:22,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:12:22,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:12:22,265 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:12:22,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:12:22,265 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:12:22,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:12:22,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:12:22,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:12:22,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:12:22,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:12:22,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:12:22,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:12:22,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:12:22,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:12:22,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:12:22,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:12:22,275 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:12:22,275 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 -> 68654c5c5ca49f0f291b56dff0b35b602882e8f2 [2021-09-13 14:12:22,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:12:22,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:12:22,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:12:22,584 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:12:22,585 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:12:22,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/loopv2.c [2021-09-13 14:12:22,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a091083/0354a3991d364089824b0017e5d78faf/FLAG4d8f2c3fa [2021-09-13 14:12:23,087 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:12:23,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/loopv2.c [2021-09-13 14:12:23,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a091083/0354a3991d364089824b0017e5d78faf/FLAG4d8f2c3fa [2021-09-13 14:12:23,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a091083/0354a3991d364089824b0017e5d78faf [2021-09-13 14:12:23,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:12:23,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:12:23,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:12:23,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:12:23,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:12:23,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71ae0277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23, skipping insertion in model container [2021-09-13 14:12:23,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:12:23,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:12:23,271 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/loopv2.c[454,467] [2021-09-13 14:12:23,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:12:23,297 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:12:23,308 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/loopv2.c[454,467] [2021-09-13 14:12:23,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:12:23,334 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:12:23,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23 WrapperNode [2021-09-13 14:12:23,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:12:23,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:12:23,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:12:23,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:12:23,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:12:23,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:12:23,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:12:23,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:12:23,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:12:23,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:12:23,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:12:23,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:12:23,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (1/1) ... [2021-09-13 14:12:23,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:12:23,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:23,475 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) [2021-09-13 14:12:23,496 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 [2021-09-13 14:12:23,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:12:23,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:12:23,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:12:23,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:12:23,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:12:23,780 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-09-13 14:12:23,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:23 BoogieIcfgContainer [2021-09-13 14:12:23,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:12:23,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:12:23,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:12:23,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:12:23,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:12:23" (1/3) ... [2021-09-13 14:12:23,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357aa5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:12:23, skipping insertion in model container [2021-09-13 14:12:23,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:23" (2/3) ... [2021-09-13 14:12:23,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357aa5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:12:23, skipping insertion in model container [2021-09-13 14:12:23,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:23" (3/3) ... [2021-09-13 14:12:23,804 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv2.c [2021-09-13 14:12:23,808 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:12:23,808 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:12:23,871 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:12:23,875 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-09-13 14:12:23,876 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:12:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 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) [2021-09-13 14:12:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-13 14:12:23,889 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:23,889 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:23,890 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1446330702, now seen corresponding path program 1 times [2021-09-13 14:12:23,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:23,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183402562] [2021-09-13 14:12:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:23,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:24,015 INFO L281 TraceCheckUtils]: 0: Hoare triple {17#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {17#true} is VALID [2021-09-13 14:12:24,016 INFO L281 TraceCheckUtils]: 1: Hoare triple {17#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~j~0, main_~k~0;havoc main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {17#true} is VALID [2021-09-13 14:12:24,016 INFO L281 TraceCheckUtils]: 2: Hoare triple {17#true} assume !!(main_~n~0 <= ~SIZE~0);main_~i~0 := 0;main_~j~0 := 0; {17#true} is VALID [2021-09-13 14:12:24,017 INFO L281 TraceCheckUtils]: 3: Hoare triple {17#true} assume !true; {18#false} is VALID [2021-09-13 14:12:24,017 INFO L281 TraceCheckUtils]: 4: Hoare triple {18#false} main_~k~0 := main_~i~0; {18#false} is VALID [2021-09-13 14:12:24,017 INFO L281 TraceCheckUtils]: 5: Hoare triple {18#false} assume !(0 == (if main_~j~0 < 0 && 0 != main_~j~0 % 2 then main_~j~0 % 2 - 2 else main_~j~0 % 2)); {18#false} is VALID [2021-09-13 14:12:24,024 INFO L281 TraceCheckUtils]: 6: Hoare triple {18#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~k~0 < 0 && 0 != main_~k~0 % 2 then main_~k~0 % 2 - 2 else main_~k~0 % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18#false} is VALID [2021-09-13 14:12:24,024 INFO L281 TraceCheckUtils]: 7: Hoare triple {18#false} assume 0 == __VERIFIER_assert_~cond; {18#false} is VALID [2021-09-13 14:12:24,025 INFO L281 TraceCheckUtils]: 8: Hoare triple {18#false} assume !false; {18#false} is VALID [2021-09-13 14:12:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:24,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:24,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183402562] [2021-09-13 14:12:24,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183402562] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:12:24,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:12:24,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:12:24,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303071539] [2021-09-13 14:12:24,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-09-13 14:12:24,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:24,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:24,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:12:24,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:12:24,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:12:24,067 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 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 has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:24,109 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2021-09-13 14:12:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:12:24,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-09-13 14:12:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2021-09-13 14:12:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2021-09-13 14:12:24,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 31 transitions. [2021-09-13 14:12:24,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:24,167 INFO L225 Difference]: With dead ends: 24 [2021-09-13 14:12:24,167 INFO L226 Difference]: Without dead ends: 10 [2021-09-13 14:12:24,170 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:12:24,174 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.35ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.10ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:24,175 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 16 Unknown, 0 Unchecked, 0.35ms Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 14.10ms Time] [2021-09-13 14:12:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-09-13 14:12:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-09-13 14:12:24,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:24,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) 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) [2021-09-13 14:12:24,196 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) 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) [2021-09-13 14:12:24,196 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) 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) [2021-09-13 14:12:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:24,199 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-09-13 14:12:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-09-13 14:12:24,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:24,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:24,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.2222222222222223) 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 10 states. [2021-09-13 14:12:24,200 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.2222222222222223) 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 10 states. [2021-09-13 14:12:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:24,206 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-09-13 14:12:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-09-13 14:12:24,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:24,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:24,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:24,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) 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) [2021-09-13 14:12:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-09-13 14:12:24,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2021-09-13 14:12:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:24,211 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-09-13 14:12:24,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-09-13 14:12:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-13 14:12:24,213 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:24,214 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:24,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:12:24,215 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1331814098, now seen corresponding path program 1 times [2021-09-13 14:12:24,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:24,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635278159] [2021-09-13 14:12:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:24,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:24,346 INFO L281 TraceCheckUtils]: 0: Hoare triple {84#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {84#true} is VALID [2021-09-13 14:12:24,346 INFO L281 TraceCheckUtils]: 1: Hoare triple {84#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~j~0, main_~k~0;havoc main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {84#true} is VALID [2021-09-13 14:12:24,346 INFO L281 TraceCheckUtils]: 2: Hoare triple {84#true} assume !!(main_~n~0 <= ~SIZE~0);main_~i~0 := 0;main_~j~0 := 0; {86#(= ULTIMATE.start_main_~j~0 0)} is VALID [2021-09-13 14:12:24,347 INFO L281 TraceCheckUtils]: 3: Hoare triple {86#(= ULTIMATE.start_main_~j~0 0)} assume !(main_~i~0 < main_~n~0); {86#(= ULTIMATE.start_main_~j~0 0)} is VALID [2021-09-13 14:12:24,347 INFO L281 TraceCheckUtils]: 4: Hoare triple {86#(= ULTIMATE.start_main_~j~0 0)} main_~k~0 := main_~i~0; {86#(= ULTIMATE.start_main_~j~0 0)} is VALID [2021-09-13 14:12:24,353 INFO L281 TraceCheckUtils]: 5: Hoare triple {86#(= ULTIMATE.start_main_~j~0 0)} assume !(0 == (if main_~j~0 < 0 && 0 != main_~j~0 % 2 then main_~j~0 % 2 - 2 else main_~j~0 % 2)); {85#false} is VALID [2021-09-13 14:12:24,354 INFO L281 TraceCheckUtils]: 6: Hoare triple {85#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~k~0 < 0 && 0 != main_~k~0 % 2 then main_~k~0 % 2 - 2 else main_~k~0 % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {85#false} is VALID [2021-09-13 14:12:24,354 INFO L281 TraceCheckUtils]: 7: Hoare triple {85#false} assume 0 == __VERIFIER_assert_~cond; {85#false} is VALID [2021-09-13 14:12:24,354 INFO L281 TraceCheckUtils]: 8: Hoare triple {85#false} assume !false; {85#false} is VALID [2021-09-13 14:12:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:24,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:24,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635278159] [2021-09-13 14:12:24,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635278159] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:12:24,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:12:24,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:12:24,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371536593] [2021-09-13 14:12:24,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-09-13 14:12:24,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:24,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:24,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-13 14:12:24,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:24,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-13 14:12:24,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-13 14:12:24,370 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:24,437 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 14:12:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-13 14:12:24,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-09-13 14:12:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2021-09-13 14:12:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2021-09-13 14:12:24,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2021-09-13 14:12:24,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:24,465 INFO L225 Difference]: With dead ends: 17 [2021-09-13 14:12:24,465 INFO L226 Difference]: Without dead ends: 13 [2021-09-13 14:12:24,465 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.62ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-13 14:12:24,466 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.52ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.21ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:24,467 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 21 Unknown, 0 Unchecked, 0.52ms Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 31.21ms Time] [2021-09-13 14:12:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-09-13 14:12:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-09-13 14:12:24,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:24,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,472 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,472 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:24,473 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-09-13 14:12:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-09-13 14:12:24,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:24,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:24,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2021-09-13 14:12:24,474 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2021-09-13 14:12:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:24,475 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-09-13 14:12:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-09-13 14:12:24,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:24,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:24,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:24,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-09-13 14:12:24,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2021-09-13 14:12:24,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:24,477 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-09-13 14:12:24,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-09-13 14:12:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:12:24,478 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:24,491 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:24,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 14:12:24,495 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:24,495 INFO L82 PathProgramCache]: Analyzing trace with hash -66849766, now seen corresponding path program 1 times [2021-09-13 14:12:24,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:24,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487572649] [2021-09-13 14:12:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:24,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:24,673 INFO L281 TraceCheckUtils]: 0: Hoare triple {153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {153#true} is VALID [2021-09-13 14:12:24,674 INFO L281 TraceCheckUtils]: 1: Hoare triple {153#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~j~0, main_~k~0;havoc main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {153#true} is VALID [2021-09-13 14:12:24,674 INFO L281 TraceCheckUtils]: 2: Hoare triple {153#true} assume !!(main_~n~0 <= ~SIZE~0);main_~i~0 := 0;main_~j~0 := 0; {155#(= ULTIMATE.start_main_~i~0 0)} is VALID [2021-09-13 14:12:24,675 INFO L281 TraceCheckUtils]: 3: Hoare triple {155#(= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~n~0);main_~i~0 := 4 + main_~i~0;main_~j~0 := 2 + main_~i~0; {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} is VALID [2021-09-13 14:12:24,675 INFO L281 TraceCheckUtils]: 4: Hoare triple {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} assume !(main_~i~0 < main_~n~0); {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} is VALID [2021-09-13 14:12:24,676 INFO L281 TraceCheckUtils]: 5: Hoare triple {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} main_~k~0 := main_~i~0; {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} is VALID [2021-09-13 14:12:24,677 INFO L281 TraceCheckUtils]: 6: Hoare triple {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} assume !(0 == (if main_~j~0 < 0 && 0 != main_~j~0 % 2 then main_~j~0 % 2 - 2 else main_~j~0 % 2)); {154#false} is VALID [2021-09-13 14:12:24,677 INFO L281 TraceCheckUtils]: 7: Hoare triple {154#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~k~0 < 0 && 0 != main_~k~0 % 2 then main_~k~0 % 2 - 2 else main_~k~0 % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {154#false} is VALID [2021-09-13 14:12:24,677 INFO L281 TraceCheckUtils]: 8: Hoare triple {154#false} assume 0 == __VERIFIER_assert_~cond; {154#false} is VALID [2021-09-13 14:12:24,677 INFO L281 TraceCheckUtils]: 9: Hoare triple {154#false} assume !false; {154#false} is VALID [2021-09-13 14:12:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:24,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:24,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487572649] [2021-09-13 14:12:24,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487572649] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:24,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372475467] [2021-09-13 14:12:24,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:24,679 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:24,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:24,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:24,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:12:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:24,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:12:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:24,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:24,869 INFO L281 TraceCheckUtils]: 0: Hoare triple {153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {153#true} is VALID [2021-09-13 14:12:24,870 INFO L281 TraceCheckUtils]: 1: Hoare triple {153#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~j~0, main_~k~0;havoc main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {153#true} is VALID [2021-09-13 14:12:24,870 INFO L281 TraceCheckUtils]: 2: Hoare triple {153#true} assume !!(main_~n~0 <= ~SIZE~0);main_~i~0 := 0;main_~j~0 := 0; {155#(= ULTIMATE.start_main_~i~0 0)} is VALID [2021-09-13 14:12:24,871 INFO L281 TraceCheckUtils]: 3: Hoare triple {155#(= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~n~0);main_~i~0 := 4 + main_~i~0;main_~j~0 := 2 + main_~i~0; {169#(= ULTIMATE.start_main_~j~0 6)} is VALID [2021-09-13 14:12:24,871 INFO L281 TraceCheckUtils]: 4: Hoare triple {169#(= ULTIMATE.start_main_~j~0 6)} assume !(main_~i~0 < main_~n~0); {169#(= ULTIMATE.start_main_~j~0 6)} is VALID [2021-09-13 14:12:24,872 INFO L281 TraceCheckUtils]: 5: Hoare triple {169#(= ULTIMATE.start_main_~j~0 6)} main_~k~0 := main_~i~0; {169#(= ULTIMATE.start_main_~j~0 6)} is VALID [2021-09-13 14:12:24,872 INFO L281 TraceCheckUtils]: 6: Hoare triple {169#(= ULTIMATE.start_main_~j~0 6)} assume !(0 == (if main_~j~0 < 0 && 0 != main_~j~0 % 2 then main_~j~0 % 2 - 2 else main_~j~0 % 2)); {154#false} is VALID [2021-09-13 14:12:24,873 INFO L281 TraceCheckUtils]: 7: Hoare triple {154#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~k~0 < 0 && 0 != main_~k~0 % 2 then main_~k~0 % 2 - 2 else main_~k~0 % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {154#false} is VALID [2021-09-13 14:12:24,873 INFO L281 TraceCheckUtils]: 8: Hoare triple {154#false} assume 0 == __VERIFIER_assert_~cond; {154#false} is VALID [2021-09-13 14:12:24,873 INFO L281 TraceCheckUtils]: 9: Hoare triple {154#false} assume !false; {154#false} is VALID [2021-09-13 14:12:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:24,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:24,950 INFO L281 TraceCheckUtils]: 9: Hoare triple {154#false} assume !false; {154#false} is VALID [2021-09-13 14:12:24,951 INFO L281 TraceCheckUtils]: 8: Hoare triple {154#false} assume 0 == __VERIFIER_assert_~cond; {154#false} is VALID [2021-09-13 14:12:24,951 INFO L281 TraceCheckUtils]: 7: Hoare triple {154#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~k~0 < 0 && 0 != main_~k~0 % 2 then main_~k~0 % 2 - 2 else main_~k~0 % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {154#false} is VALID [2021-09-13 14:12:24,952 INFO L281 TraceCheckUtils]: 6: Hoare triple {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} assume !(0 == (if main_~j~0 < 0 && 0 != main_~j~0 % 2 then main_~j~0 % 2 - 2 else main_~j~0 % 2)); {154#false} is VALID [2021-09-13 14:12:24,952 INFO L281 TraceCheckUtils]: 5: Hoare triple {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} main_~k~0 := main_~i~0; {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} is VALID [2021-09-13 14:12:24,953 INFO L281 TraceCheckUtils]: 4: Hoare triple {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} assume !(main_~i~0 < main_~n~0); {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} is VALID [2021-09-13 14:12:24,955 INFO L281 TraceCheckUtils]: 3: Hoare triple {206#(= (* 2 (div (+ ULTIMATE.start_main_~i~0 6) 2)) (+ ULTIMATE.start_main_~i~0 6))} assume !!(main_~i~0 < main_~n~0);main_~i~0 := 4 + main_~i~0;main_~j~0 := 2 + main_~i~0; {156#(= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2)))} is VALID [2021-09-13 14:12:24,956 INFO L281 TraceCheckUtils]: 2: Hoare triple {153#true} assume !!(main_~n~0 <= ~SIZE~0);main_~i~0 := 0;main_~j~0 := 0; {206#(= (* 2 (div (+ ULTIMATE.start_main_~i~0 6) 2)) (+ ULTIMATE.start_main_~i~0 6))} is VALID [2021-09-13 14:12:24,956 INFO L281 TraceCheckUtils]: 1: Hoare triple {153#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~j~0, main_~k~0;havoc main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {153#true} is VALID [2021-09-13 14:12:24,957 INFO L281 TraceCheckUtils]: 0: Hoare triple {153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 50000001; {153#true} is VALID [2021-09-13 14:12:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:24,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372475467] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:24,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:24,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-09-13 14:12:24,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077864890] [2021-09-13 14:12:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 10 [2021-09-13 14:12:24,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:24,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-09-13 14:12:24,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:24,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:12:24,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:24,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:12:24,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:12:24,985 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-09-13 14:12:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:25,119 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2021-09-13 14:12:25,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:12:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 10 [2021-09-13 14:12:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-09-13 14:12:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-09-13 14:12:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-09-13 14:12:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-09-13 14:12:25,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2021-09-13 14:12:25,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:25,159 INFO L225 Difference]: With dead ends: 17 [2021-09-13 14:12:25,159 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:12:25,160 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 55.96ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:12:25,163 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.05ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.74ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:25,165 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 1.05ms Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 38.74ms Time] [2021-09-13 14:12:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:12:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:12:25,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:25,166 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) [2021-09-13 14:12:25,167 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) [2021-09-13 14:12:25,167 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) [2021-09-13 14:12:25,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:25,168 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:12:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:25,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:25,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:25,182 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. [2021-09-13 14:12:25,182 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. [2021-09-13 14:12:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:25,183 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:12:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:25,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:25,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:25,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:25,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:25,184 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) [2021-09-13 14:12:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:12:25,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2021-09-13 14:12:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:25,184 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:12:25,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-09-13 14:12:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:25,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:25,187 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 14:12:25,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:25,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:25,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:12:25,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:25,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:25,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:25,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:25,449 INFO L861 garLoopResultBuilder]: At program point L33(lines 17 34) the Hoare annotation is: true [2021-09-13 14:12:25,450 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:12:25,450 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2021-09-13 14:12:25,450 INFO L861 garLoopResultBuilder]: At program point L11-2(lines 10 15) the Hoare annotation is: true [2021-09-13 14:12:25,450 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:12:25,450 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:12:25,450 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:12:25,450 INFO L854 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (and (= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse0 (+ ULTIMATE.start_main_~i~0 6))) (= (* 2 (div .cse0 2)) .cse0))) [2021-09-13 14:12:25,450 INFO L858 garLoopResultBuilder]: For program point L28-3(lines 28 31) no Hoare annotation was computed. [2021-09-13 14:12:25,451 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:12:25,451 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-09-13 14:12:25,451 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (= ULTIMATE.start_main_~j~0 (* 2 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse0 (+ ULTIMATE.start_main_~i~0 6))) (= (* 2 (div .cse0 2)) .cse0))) [2021-09-13 14:12:25,451 INFO L858 garLoopResultBuilder]: For program point L22-3(lines 22 26) no Hoare annotation was computed. [2021-09-13 14:12:25,451 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-09-13 14:12:25,454 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:12:25,457 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:12:25,457 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:12:25,457 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2021-09-13 14:12:25,457 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2021-09-13 14:12:25,458 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:12:25,458 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2021-09-13 14:12:25,458 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2021-09-13 14:12:25,459 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:12:25,459 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2021-09-13 14:12:25,459 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2021-09-13 14:12:25,460 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2021-09-13 14:12:25,461 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2021-09-13 14:12:25,461 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:12:25,461 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:12:25,461 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:12:25,461 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:12:25,461 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:12:25,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:12:25 BoogieIcfgContainer [2021-09-13 14:12:25,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:12:25,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:12:25,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:12:25,469 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:12:25,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:23" (3/4) ... [2021-09-13 14:12:25,471 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:12:25,479 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-09-13 14:12:25,479 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:12:25,479 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:12:25,479 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:12:25,500 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:12:25,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:12:25,501 INFO L158 Benchmark]: Toolchain (without parser) took 2390.94ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 52.6MB in the beginning and 61.0MB in the end (delta: -8.4MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2021-09-13 14:12:25,501 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 69.2MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:12:25,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.42ms. Allocated memory is still 69.2MB. Free memory was 52.3MB in the beginning and 42.5MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:12:25,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.66ms. Allocated memory is still 69.2MB. Free memory was 42.5MB in the beginning and 53.2MB in the end (delta: -10.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:12:25,502 INFO L158 Benchmark]: Boogie Preprocessor took 30.42ms. Allocated memory is still 69.2MB. Free memory was 53.2MB in the beginning and 52.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:12:25,502 INFO L158 Benchmark]: RCFGBuilder took 357.59ms. Allocated memory is still 69.2MB. Free memory was 52.1MB in the beginning and 42.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:12:25,502 INFO L158 Benchmark]: TraceAbstraction took 1680.29ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 41.9MB in the beginning and 63.8MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:12:25,503 INFO L158 Benchmark]: Witness Printer took 31.55ms. Allocated memory is still 88.1MB. Free memory was 63.8MB in the beginning and 61.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:12:25,504 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 69.2MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.42ms. Allocated memory is still 69.2MB. Free memory was 52.3MB in the beginning and 42.5MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.66ms. Allocated memory is still 69.2MB. Free memory was 42.5MB in the beginning and 53.2MB in the end (delta: -10.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.42ms. Allocated memory is still 69.2MB. Free memory was 53.2MB in the beginning and 52.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 357.59ms. Allocated memory is still 69.2MB. Free memory was 52.1MB in the beginning and 42.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1680.29ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 41.9MB in the beginning and 63.8MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 31.55ms. Allocated memory is still 88.1MB. Free memory was 63.8MB in the beginning and 61.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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: 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, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1587.69ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 8.25ms, AutomataDifference: 411.03ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 47.90ms, InitialAbstractionConstructionTime: 6.42ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 84.05ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 81.02ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 0 mSDtfsCounter, 63 mSolverCounterSat, 1.92ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 63.64ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 51.19ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 12 NumberOfFragments, 40 HoareAnnotationTreeSize, 4 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 14.06ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 26.20ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 34.30ms SsaConstructionTime, 115.10ms SatisfiabilityAnalysisTime, 472.72ms InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 105 SizeOfPredicates, 2 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: j == 2 * (j / 2) && 2 * ((i + 6) / 2) == i + 6 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: j == 2 * (j / 2) && 2 * ((i + 6) / 2) == i + 6 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:12:25,539 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...