./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/sanfoundry_24-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-examples/sanfoundry_24-1.i -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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9633849a7b58c2c6c6845d63f4474af8185fd385 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 14:14:00,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:14:00,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:14:00,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:14:00,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:14:00,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:14:00,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:14:00,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:14:00,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:14:00,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:14:00,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:14:00,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:14:00,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:14:00,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:14:00,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:14:00,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:14:00,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:14:00,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:14:00,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:14:00,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:14:00,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:14:00,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:14:00,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:14:00,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:14:00,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:14:00,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:14:00,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:14:00,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:14:00,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:14:00,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:14:00,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:14:00,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:14:00,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:14:00,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:14:00,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:14:00,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:14:00,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:14:00,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:14:00,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:14:00,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:14:00,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:14:00,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:14:00,110 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:14:00,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:14:00,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:14:00,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:14:00,112 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:14:00,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:14:00,113 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:14:00,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:14:00,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:14:00,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:14:00,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:14:00,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:14:00,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:14:00,114 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:14:00,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:14:00,115 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:14:00,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:14:00,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:14:00,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:14:00,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:14:00,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:14:00,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:14:00,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:14:00,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:14:00,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:14:00,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:14:00,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:14:00,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:14:00,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:14:00,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 9633849a7b58c2c6c6845d63f4474af8185fd385 [2020-07-28 14:14:00,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:14:00,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:14:00,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:14:00,467 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:14:00,467 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:14:00,468 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/sanfoundry_24-1.i [2020-07-28 14:14:00,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538b9e2f1/8458d1b069404227bf93e052479cfd49/FLAG96258d5d3 [2020-07-28 14:14:00,996 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:14:00,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_24-1.i [2020-07-28 14:14:01,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538b9e2f1/8458d1b069404227bf93e052479cfd49/FLAG96258d5d3 [2020-07-28 14:14:01,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538b9e2f1/8458d1b069404227bf93e052479cfd49 [2020-07-28 14:14:01,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:14:01,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:14:01,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:14:01,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:14:01,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:14:01,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ade0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01, skipping insertion in model container [2020-07-28 14:14:01,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:14:01,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:14:01,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:14:01,663 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:14:01,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:14:01,730 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:14:01,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01 WrapperNode [2020-07-28 14:14:01,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:14:01,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:14:01,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:14:01,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:14:01,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:14:01,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:14:01,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:14:01,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:14:01,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... [2020-07-28 14:14:01,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:14:01,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:14:01,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:14:01,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:14:01,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:14:01,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:14:01,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:14:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:14:01,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:14:01,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:14:01,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:14:02,356 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:14:02,357 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-28 14:14:02,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:14:02 BoogieIcfgContainer [2020-07-28 14:14:02,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:14:02,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:14:02,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:14:02,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:14:02,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:14:01" (1/3) ... [2020-07-28 14:14:02,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381b575a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:14:02, skipping insertion in model container [2020-07-28 14:14:02,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:14:01" (2/3) ... [2020-07-28 14:14:02,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381b575a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:14:02, skipping insertion in model container [2020-07-28 14:14:02,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:14:02" (3/3) ... [2020-07-28 14:14:02,370 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_24-1.i [2020-07-28 14:14:02,381 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:14:02,389 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-28 14:14:02,402 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-28 14:14:02,423 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:14:02,423 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:14:02,423 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:14:02,424 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:14:02,424 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:14:02,424 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:14:02,424 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:14:02,425 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:14:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-28 14:14:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 14:14:02,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:14:02,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:14:02,451 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:14:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:14:02,458 INFO L82 PathProgramCache]: Analyzing trace with hash 212104336, now seen corresponding path program 1 times [2020-07-28 14:14:02,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:14:02,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640137162] [2020-07-28 14:14:02,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:14:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:14:02,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2020-07-28 14:14:02,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; {29#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:14:02,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < main_~num~0); {30#(<= ULTIMATE.start_main_~num~0 0)} is VALID [2020-07-28 14:14:02,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {30#(<= ULTIMATE.start_main_~num~0 0)} main_~i~0 := 0; {31#(and (= 0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~num~0 0))} is VALID [2020-07-28 14:14:02,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#(and (= 0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~num~0 0))} assume !!(main_~i~0 < main_~num~0);call main_#t~mem4 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); {28#false} is VALID [2020-07-28 14:14:02,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#false} assume 0 == (if main_#t~mem4 < 0 && 0 != main_#t~mem4 % 2 then main_#t~mem4 % 2 - 2 else main_#t~mem4 % 2);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printEven_#in~i := main_#t~mem5;havoc printEven_~i;printEven_~i := printEven_#in~i;__VERIFIER_assert_#in~cond := (if 0 == (if printEven_~i < 0 && 0 != printEven_~i % 2 then printEven_~i % 2 - 2 else printEven_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {28#false} is VALID [2020-07-28 14:14:02,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#false} assume 0 == __VERIFIER_assert_~cond; {28#false} is VALID [2020-07-28 14:14:02,712 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-28 14:14:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:14:02,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640137162] [2020-07-28 14:14:02,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:14:02,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 14:14:02,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119169375] [2020-07-28 14:14:02,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-28 14:14:02,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:14:02,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 14:14:02,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:14:02,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 14:14:02,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:14:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 14:14:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:14:02,771 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-28 14:14:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:03,084 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2020-07-28 14:14:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:14:03,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-28 14:14:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:14:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:14:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2020-07-28 14:14:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:14:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2020-07-28 14:14:03,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2020-07-28 14:14:03,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:14:03,292 INFO L225 Difference]: With dead ends: 68 [2020-07-28 14:14:03,292 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 14:14:03,296 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:14:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 14:14:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2020-07-28 14:14:03,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:14:03,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 22 states. [2020-07-28 14:14:03,328 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 22 states. [2020-07-28 14:14:03,328 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 22 states. [2020-07-28 14:14:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:03,332 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2020-07-28 14:14:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-28 14:14:03,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:14:03,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:14:03,334 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 36 states. [2020-07-28 14:14:03,335 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 36 states. [2020-07-28 14:14:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:03,338 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2020-07-28 14:14:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-28 14:14:03,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:14:03,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:14:03,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:14:03,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:14:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 14:14:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-28 14:14:03,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 8 [2020-07-28 14:14:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:14:03,345 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-28 14:14:03,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 14:14:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-28 14:14:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 14:14:03,346 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:14:03,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:14:03,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:14:03,347 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:14:03,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:14:03,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1436002194, now seen corresponding path program 1 times [2020-07-28 14:14:03,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:14:03,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248180538] [2020-07-28 14:14:03,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:14:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:14:03,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {214#true} is VALID [2020-07-28 14:14:03,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {214#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; {214#true} is VALID [2020-07-28 14:14:03,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {214#true} assume !!(main_~i~0 < main_~num~0);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;call write~int(main_#t~nondet2, main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet2; {214#true} is VALID [2020-07-28 14:14:03,526 INFO L280 TraceCheckUtils]: 3: Hoare triple {214#true} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {214#true} is VALID [2020-07-28 14:14:03,526 INFO L280 TraceCheckUtils]: 4: Hoare triple {214#true} assume !(main_~i~0 < main_~num~0); {214#true} is VALID [2020-07-28 14:14:03,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#true} main_~i~0 := 0; {214#true} is VALID [2020-07-28 14:14:03,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {214#true} assume !!(main_~i~0 < main_~num~0);call main_#t~mem4 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); {216#(= |ULTIMATE.start_main_#t~mem4| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|) (+ |ULTIMATE.start_main_~#array~0.offset| (* ULTIMATE.start_main_~i~0 4))))} is VALID [2020-07-28 14:14:03,530 INFO L280 TraceCheckUtils]: 7: Hoare triple {216#(= |ULTIMATE.start_main_#t~mem4| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|) (+ |ULTIMATE.start_main_~#array~0.offset| (* ULTIMATE.start_main_~i~0 4))))} assume 0 == (if main_#t~mem4 < 0 && 0 != main_#t~mem4 % 2 then main_#t~mem4 % 2 - 2 else main_#t~mem4 % 2);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printEven_#in~i := main_#t~mem5;havoc printEven_~i;printEven_~i := printEven_#in~i;__VERIFIER_assert_#in~cond := (if 0 == (if printEven_~i < 0 && 0 != printEven_~i % 2 then printEven_~i % 2 - 2 else printEven_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {217#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 14:14:03,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {215#false} is VALID [2020-07-28 14:14:03,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {215#false} assume !false; {215#false} is VALID [2020-07-28 14:14:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 14:14:03,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248180538] [2020-07-28 14:14:03,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:14:03,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:14:03,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159142448] [2020-07-28 14:14:03,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 14:14:03,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:14:03,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:14:03,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:14:03,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:14:03,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:14:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:14:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:14:03,556 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2020-07-28 14:14:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:03,735 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-28 14:14:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 14:14:03,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 14:14:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:14:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:14:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-28 14:14:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:14:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-28 14:14:03,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-28 14:14:03,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:14:03,792 INFO L225 Difference]: With dead ends: 29 [2020-07-28 14:14:03,792 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 14:14:03,793 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:14:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 14:14:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2020-07-28 14:14:03,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:14:03,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 20 states. [2020-07-28 14:14:03,804 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 20 states. [2020-07-28 14:14:03,804 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 20 states. [2020-07-28 14:14:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:03,807 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-28 14:14:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-28 14:14:03,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:14:03,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:14:03,808 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states. [2020-07-28 14:14:03,808 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states. [2020-07-28 14:14:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:03,811 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-28 14:14:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-28 14:14:03,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:14:03,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:14:03,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:14:03,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:14:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 14:14:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-07-28 14:14:03,814 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2020-07-28 14:14:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:14:03,815 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-28 14:14:03,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:14:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-28 14:14:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 14:14:03,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:14:03,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:14:03,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:14:03,817 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:14:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:14:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash 906460810, now seen corresponding path program 1 times [2020-07-28 14:14:03,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:14:03,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196210233] [2020-07-28 14:14:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:14:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:14:03,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {337#true} is VALID [2020-07-28 14:14:03,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {337#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; {337#true} is VALID [2020-07-28 14:14:03,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {337#true} assume !!(main_~i~0 < main_~num~0);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;call write~int(main_#t~nondet2, main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet2; {337#true} is VALID [2020-07-28 14:14:03,919 INFO L280 TraceCheckUtils]: 3: Hoare triple {337#true} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {337#true} is VALID [2020-07-28 14:14:03,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {337#true} assume !(main_~i~0 < main_~num~0); {337#true} is VALID [2020-07-28 14:14:03,921 INFO L280 TraceCheckUtils]: 5: Hoare triple {337#true} main_~i~0 := 0; {337#true} is VALID [2020-07-28 14:14:03,921 INFO L280 TraceCheckUtils]: 6: Hoare triple {337#true} assume !!(main_~i~0 < main_~num~0);call main_#t~mem4 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); {337#true} is VALID [2020-07-28 14:14:03,922 INFO L280 TraceCheckUtils]: 7: Hoare triple {337#true} assume !(0 == (if main_#t~mem4 < 0 && 0 != main_#t~mem4 % 2 then main_#t~mem4 % 2 - 2 else main_#t~mem4 % 2));havoc main_#t~mem4; {337#true} is VALID [2020-07-28 14:14:03,922 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#true} main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; {337#true} is VALID [2020-07-28 14:14:03,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {337#true} assume !(main_~i~0 < main_~num~0); {337#true} is VALID [2020-07-28 14:14:03,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {337#true} main_~i~0 := 0; {337#true} is VALID [2020-07-28 14:14:03,928 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#true} assume !!(main_~i~0 < main_~num~0);call main_#t~mem7 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); {339#(= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|) (+ |ULTIMATE.start_main_~#array~0.offset| (* ULTIMATE.start_main_~i~0 4))))} is VALID [2020-07-28 14:14:03,930 INFO L280 TraceCheckUtils]: 12: Hoare triple {339#(= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|) (+ |ULTIMATE.start_main_~#array~0.offset| (* ULTIMATE.start_main_~i~0 4))))} assume 0 != (if main_#t~mem7 < 0 && 0 != main_#t~mem7 % 2 then main_#t~mem7 % 2 - 2 else main_#t~mem7 % 2);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem8;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {340#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 14:14:03,931 INFO L280 TraceCheckUtils]: 13: Hoare triple {340#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {338#false} is VALID [2020-07-28 14:14:03,932 INFO L280 TraceCheckUtils]: 14: Hoare triple {338#false} assume !false; {338#false} is VALID [2020-07-28 14:14:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 14:14:03,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196210233] [2020-07-28 14:14:03,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:14:03,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:14:03,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141221744] [2020-07-28 14:14:03,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 14:14:03,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:14:03,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:14:03,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:14:03,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:14:03,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:14:03,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:14:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:14:03,959 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 4 states. [2020-07-28 14:14:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:04,123 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-28 14:14:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 14:14:04,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 14:14:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:14:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:14:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-28 14:14:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:14:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-28 14:14:04,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-28 14:14:04,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:14:04,180 INFO L225 Difference]: With dead ends: 27 [2020-07-28 14:14:04,181 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 14:14:04,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:14:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 14:14:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 14:14:04,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:14:04,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 14:14:04,183 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 14:14:04,183 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 14:14:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:04,183 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 14:14:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 14:14:04,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:14:04,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:14:04,185 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 14:14:04,185 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 14:14:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:14:04,185 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 14:14:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 14:14:04,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:14:04,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:14:04,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:14:04,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:14:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 14:14:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 14:14:04,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-28 14:14:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:14:04,188 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 14:14:04,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:14:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 14:14:04,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:14:04,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 14:14:04,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 14:14:04,215 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-07-28 14:14:04,215 INFO L268 CegarLoopResult]: For program point L23(lines 23 26) no Hoare annotation was computed. [2020-07-28 14:14:04,215 INFO L268 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-07-28 14:14:04,216 INFO L268 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-07-28 14:14:04,216 INFO L268 CegarLoopResult]: For program point L3-3(lines 1 36) no Hoare annotation was computed. [2020-07-28 14:14:04,216 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 14:14:04,216 INFO L268 CegarLoopResult]: For program point L3-4(line 3) no Hoare annotation was computed. [2020-07-28 14:14:04,217 INFO L268 CegarLoopResult]: For program point L3-5(line 3) no Hoare annotation was computed. [2020-07-28 14:14:04,217 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 14:14:04,217 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 14:14:04,217 INFO L268 CegarLoopResult]: For program point L3-7(lines 1 36) no Hoare annotation was computed. [2020-07-28 14:14:04,217 INFO L268 CegarLoopResult]: For program point L28-2(lines 28 34) no Hoare annotation was computed. [2020-07-28 14:14:04,217 INFO L271 CegarLoopResult]: At program point L28-3(lines 28 34) the Hoare annotation is: true [2020-07-28 14:14:04,218 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-07-28 14:14:04,218 INFO L268 CegarLoopResult]: For program point L28-4(lines 28 34) no Hoare annotation was computed. [2020-07-28 14:14:04,218 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 19) no Hoare annotation was computed. [2020-07-28 14:14:04,218 INFO L271 CegarLoopResult]: At program point L16-3(lines 16 19) the Hoare annotation is: true [2020-07-28 14:14:04,218 INFO L268 CegarLoopResult]: For program point L16-4(lines 16 19) no Hoare annotation was computed. [2020-07-28 14:14:04,218 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 14:14:04,219 INFO L268 CegarLoopResult]: For program point L21-2(lines 21 27) no Hoare annotation was computed. [2020-07-28 14:14:04,219 INFO L271 CegarLoopResult]: At program point L21-3(lines 21 27) the Hoare annotation is: true [2020-07-28 14:14:04,219 INFO L268 CegarLoopResult]: For program point L21-4(lines 21 27) no Hoare annotation was computed. [2020-07-28 14:14:04,219 INFO L268 CegarLoopResult]: For program point L30(lines 30 33) no Hoare annotation was computed. [2020-07-28 14:14:04,220 INFO L271 CegarLoopResult]: At program point L35(lines 10 36) the Hoare annotation is: true [2020-07-28 14:14:04,225 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:14:04,225 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:14:04,225 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2020-07-28 14:14:04,226 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2020-07-28 14:14:04,226 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 14:14:04,226 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2020-07-28 14:14:04,226 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 14:14:04,226 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-28 14:14:04,227 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-28 14:14:04,227 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 14:14:04,227 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-28 14:14:04,227 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 14:14:04,227 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 14:14:04,228 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-28 14:14:04,228 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-28 14:14:04,228 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 14:14:04,228 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-28 14:14:04,228 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-28 14:14:04,229 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-28 14:14:04,229 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-28 14:14:04,229 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 14:14:04,229 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 14:14:04,229 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2020-07-28 14:14:04,230 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2020-07-28 14:14:04,230 WARN L170 areAnnotationChecker]: L3-3 has no Hoare annotation [2020-07-28 14:14:04,230 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:14:04,230 WARN L170 areAnnotationChecker]: L3-4 has no Hoare annotation [2020-07-28 14:14:04,230 WARN L170 areAnnotationChecker]: L3-4 has no Hoare annotation [2020-07-28 14:14:04,231 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-28 14:14:04,231 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:14:04,231 WARN L170 areAnnotationChecker]: L3-5 has no Hoare annotation [2020-07-28 14:14:04,231 WARN L170 areAnnotationChecker]: L3-5 has no Hoare annotation [2020-07-28 14:14:04,231 WARN L170 areAnnotationChecker]: L3-7 has no Hoare annotation [2020-07-28 14:14:04,232 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. [2020-07-28 14:14:04,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:14:04 BoogieIcfgContainer [2020-07-28 14:14:04,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:14:04,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:14:04,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:14:04,241 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:14:04,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:14:02" (3/4) ... [2020-07-28 14:14:04,247 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 14:14:04,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-07-28 14:14:04,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 14:14:04,261 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 14:14:04,321 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:14:04,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:14:04,328 INFO L168 Benchmark]: Toolchain (without parser) took 2948.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 961.6 MB in the beginning and 939.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 170.3 MB. Max. memory is 11.5 GB. [2020-07-28 14:14:04,329 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:14:04,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.42 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:14:04,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:14:04,337 INFO L168 Benchmark]: Boogie Preprocessor took 29.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:14:04,338 INFO L168 Benchmark]: RCFGBuilder took 490.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:14:04,339 INFO L168 Benchmark]: TraceAbstraction took 1878.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 945.7 MB in the end (delta: 165.5 MB). Peak memory consumption was 165.5 MB. Max. memory is 11.5 GB. [2020-07-28 14:14:04,340 INFO L168 Benchmark]: Witness Printer took 83.40 ms. Allocated memory is still 1.2 GB. Free memory was 945.7 MB in the beginning and 939.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:14:04,346 INFO L336 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.42 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 490.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1878.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 945.7 MB in the end (delta: 165.5 MB). Peak memory consumption was 165.5 MB. Max. memory is 11.5 GB. * Witness Printer took 83.40 ms. Allocated memory is still 1.2 GB. Free memory was 945.7 MB in the beginning and 939.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 69 SDtfs, 55 SDslu, 71 SDs, 0 SdLazy, 95 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 14 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...