./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/underapprox_1-2.c --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/loop-acceleration/underapprox_1-2.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6cd948af0e0b6c8603db03ff6e3dfbac759cb557 ....................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/loop-acceleration/underapprox_1-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 6cd948af0e0b6c8603db03ff6e3dfbac759cb557 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:14:32,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:14:32,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:14:32,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:14:32,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:14:32,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:14:32,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:14:32,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:14:32,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:14:32,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:14:32,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:14:32,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:14:32,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:14:32,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:14:32,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:14:32,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:14:32,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:14:32,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:14:32,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:14:32,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:14:32,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:14:32,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:14:32,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:14:32,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:14:32,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:14:32,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:14:32,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:14:32,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:14:32,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:14:32,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:14:32,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:14:32,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:14:32,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:14:32,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:14:32,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:14:32,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:14:32,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:14:32,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:14:32,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:14:32,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:14:32,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:14:32,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:14:32,880 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:14:32,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:14:32,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:14:32,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:14:32,882 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:14:32,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:14:32,882 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:14:32,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:14:32,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:14:32,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:14:32,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:14:32,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:14:32,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:14:32,884 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:14:32,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:14:32,884 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:14:32,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:14:32,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:14:32,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:14:32,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:14:32,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:14:32,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:14:32,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:14:32,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:14:32,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:14:32,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:14:32,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:14:32,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:14:32,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:14:32,887 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 -> 6cd948af0e0b6c8603db03ff6e3dfbac759cb557 [2020-07-28 18:14:33,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:14:33,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:14:33,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:14:33,327 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:14:33,327 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:14:33,328 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/underapprox_1-2.c [2020-07-28 18:14:33,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6da1274/de2dbaf0f76a4088955e43a97adf9681/FLAG393098693 [2020-07-28 18:14:33,906 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:14:33,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/underapprox_1-2.c [2020-07-28 18:14:33,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6da1274/de2dbaf0f76a4088955e43a97adf9681/FLAG393098693 [2020-07-28 18:14:34,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6da1274/de2dbaf0f76a4088955e43a97adf9681 [2020-07-28 18:14:34,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:14:34,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:14:34,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:14:34,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:14:34,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:14:34,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba39c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34, skipping insertion in model container [2020-07-28 18:14:34,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:14:34,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:14:34,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:14:34,463 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:14:34,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:14:34,494 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:14:34,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34 WrapperNode [2020-07-28 18:14:34,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:14:34,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:14:34,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:14:34,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:14:34,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:14:34,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:14:34,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:14:34,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:14:34,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (1/1) ... [2020-07-28 18:14:34,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:14:34,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:14:34,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:14:34,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:14:34,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (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 18:14:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:14:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:14:34,958 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:14:34,959 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:14:34,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:14:34 BoogieIcfgContainer [2020-07-28 18:14:34,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:14:34,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:14:34,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:14:34,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:14:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:14:34" (1/3) ... [2020-07-28 18:14:34,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d38db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:14:34, skipping insertion in model container [2020-07-28 18:14:34,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:34" (2/3) ... [2020-07-28 18:14:34,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d38db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:14:34, skipping insertion in model container [2020-07-28 18:14:34,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:14:34" (3/3) ... [2020-07-28 18:14:34,973 INFO L109 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2020-07-28 18:14:34,983 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:14:34,991 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:14:35,005 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:14:35,026 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:14:35,026 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:14:35,026 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:14:35,027 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:14:35,027 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:14:35,027 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:14:35,027 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:14:35,027 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:14:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-07-28 18:14:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:14:35,049 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:14:35,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:14:35,050 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:14:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:14:35,057 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2020-07-28 18:14:35,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:14:35,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940024676] [2020-07-28 18:14:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:14:35,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:14:35,220 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.createEquality(CClosure.java:1015) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CCTerm.mergeInternal(CCTerm.java:405) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CCTerm.merge(CCTerm.java:377) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.setLiteral(CClosure.java:855) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.setLiteral(DPLLEngine.java:458) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1191) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 18:14:35,226 INFO L168 Benchmark]: Toolchain (without parser) took 959.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -94.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:14:35,229 INFO L168 Benchmark]: CDTParser took 0.86 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 18:14:35,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.88 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 18:14:35,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:14:35,233 INFO L168 Benchmark]: Boogie Preprocessor took 43.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:14:35,234 INFO L168 Benchmark]: RCFGBuilder took 318.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:14:35,235 INFO L168 Benchmark]: TraceAbstraction took 259.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:14:35,239 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.86 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 225.88 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 103.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 318.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 259.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:14:37,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:14:37,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:14:37,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:14:37,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:14:37,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:14:37,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:14:37,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:14:37,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:14:37,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:14:37,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:14:37,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:14:37,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:14:37,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:14:37,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:14:37,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:14:37,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:14:37,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:14:37,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:14:37,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:14:37,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:14:37,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:14:37,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:14:37,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:14:37,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:14:37,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:14:37,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:14:37,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:14:37,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:14:37,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:14:37,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:14:37,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:14:37,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:14:37,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:14:37,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:14:37,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:14:37,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:14:37,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:14:37,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:14:37,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:14:37,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:14:37,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 18:14:37,326 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:14:37,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:14:37,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:14:37,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:14:37,328 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:14:37,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:14:37,329 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:14:37,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:14:37,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:14:37,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:14:37,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:14:37,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:14:37,330 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:14:37,330 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:14:37,330 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:14:37,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:14:37,331 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:14:37,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:14:37,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:14:37,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:14:37,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:14:37,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:14:37,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:14:37,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:14:37,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:14:37,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:14:37,333 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:14:37,334 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:14:37,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:14:37,334 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:14:37,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:14:37,334 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 6cd948af0e0b6c8603db03ff6e3dfbac759cb557 [2020-07-28 18:14:37,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:14:37,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:14:37,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:14:37,707 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:14:37,708 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:14:37,709 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/underapprox_1-2.c [2020-07-28 18:14:37,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab993cfa2/04de40209eef45e8a3a606f16e9878f9/FLAG17c334b16 [2020-07-28 18:14:38,244 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:14:38,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/underapprox_1-2.c [2020-07-28 18:14:38,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab993cfa2/04de40209eef45e8a3a606f16e9878f9/FLAG17c334b16 [2020-07-28 18:14:38,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab993cfa2/04de40209eef45e8a3a606f16e9878f9 [2020-07-28 18:14:38,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:14:38,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:14:38,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:14:38,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:14:38,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:14:38,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:38,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0b154e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38, skipping insertion in model container [2020-07-28 18:14:38,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:38,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:14:38,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:14:38,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:14:38,895 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:14:38,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:14:38,936 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:14:38,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38 WrapperNode [2020-07-28 18:14:38,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:14:38,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:14:38,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:14:38,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:14:38,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:38,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:39,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:14:39,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:14:39,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:14:39,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:14:39,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:39,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:39,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:39,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:39,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:39,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:39,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (1/1) ... [2020-07-28 18:14:39,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:14:39,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:14:39,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:14:39,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:14:39,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (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 18:14:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:14:39,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:14:39,374 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:14:39,374 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:14:39,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:14:39 BoogieIcfgContainer [2020-07-28 18:14:39,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:14:39,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:14:39,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:14:39,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:14:39,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:14:38" (1/3) ... [2020-07-28 18:14:39,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e123a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:14:39, skipping insertion in model container [2020-07-28 18:14:39,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:14:38" (2/3) ... [2020-07-28 18:14:39,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e123a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:14:39, skipping insertion in model container [2020-07-28 18:14:39,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:14:39" (3/3) ... [2020-07-28 18:14:39,404 INFO L109 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2020-07-28 18:14:39,430 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:14:39,436 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:14:39,461 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:14:39,479 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:14:39,479 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:14:39,479 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:14:39,480 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:14:39,480 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:14:39,480 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:14:39,480 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:14:39,480 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:14:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-07-28 18:14:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:14:39,497 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:14:39,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:14:39,499 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:14:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:14:39,504 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2020-07-28 18:14:39,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:14:39,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238385729] [2020-07-28 18:14:39,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 18:14:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:14:39,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:14:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:14:39,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:14:39,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {12#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 1bv32; {17#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:14:39,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {17#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 6bv32); {13#false} is VALID [2020-07-28 18:14:39,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {13#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~y~0, 3bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13#false} is VALID [2020-07-28 18:14:39,643 INFO L280 TraceCheckUtils]: 3: Hoare triple {13#false} assume 0bv32 == __VERIFIER_assert_~cond; {13#false} is VALID [2020-07-28 18:14:39,643 INFO L280 TraceCheckUtils]: 4: Hoare triple {13#false} assume !false; {13#false} is VALID [2020-07-28 18:14:39,645 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 18:14:39,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:14:39,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {13#false} assume !false; {13#false} is VALID [2020-07-28 18:14:39,672 INFO L280 TraceCheckUtils]: 3: Hoare triple {13#false} assume 0bv32 == __VERIFIER_assert_~cond; {13#false} is VALID [2020-07-28 18:14:39,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {13#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~y~0, 3bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13#false} is VALID [2020-07-28 18:14:39,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#(bvult ULTIMATE.start_main_~x~0 (_ bv6 32))} assume !~bvult32(main_~x~0, 6bv32); {13#false} is VALID [2020-07-28 18:14:39,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {12#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 1bv32; {39#(bvult ULTIMATE.start_main_~x~0 (_ bv6 32))} is VALID [2020-07-28 18:14:39,675 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 18:14:39,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238385729] [2020-07-28 18:14:39,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:14:39,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-07-28 18:14:39,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383247788] [2020-07-28 18:14:39,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:14:39,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:14:39,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:14:39,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:14:39,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:14:39,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:14:39,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:14:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:14:39,734 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2020-07-28 18:14:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:14:39,876 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-07-28 18:14:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:14:39,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:14:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:14:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:14:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-28 18:14:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:14:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-28 18:14:39,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2020-07-28 18:14:39,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:14:40,009 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:14:40,009 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 18:14:40,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:14:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 18:14:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 18:14:40,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:14:40,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 18:14:40,087 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:14:40,088 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:14:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:14:40,089 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2020-07-28 18:14:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-07-28 18:14:40,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:14:40,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:14:40,091 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:14:40,092 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:14:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:14:40,096 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2020-07-28 18:14:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-07-28 18:14:40,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:14:40,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:14:40,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:14:40,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:14:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:14:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-07-28 18:14:40,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2020-07-28 18:14:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:14:40,104 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-07-28 18:14:40,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:14:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-07-28 18:14:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:14:40,105 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:14:40,106 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-07-28 18:14:40,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:14:40,318 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:14:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:14:40,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 1 times [2020-07-28 18:14:40,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:14:40,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740235912] [2020-07-28 18:14:40,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 18:14:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:14:40,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:14:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:14:40,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:14:40,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 1bv32; {97#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:14:40,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {97#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {101#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:14:40,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {105#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:14:40,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {105#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 6bv32); {93#false} is VALID [2020-07-28 18:14:40,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {93#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~y~0, 3bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {93#false} is VALID [2020-07-28 18:14:40,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {93#false} assume 0bv32 == __VERIFIER_assert_~cond; {93#false} is VALID [2020-07-28 18:14:40,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-28 18:14:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:14:40,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:14:40,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-28 18:14:40,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {93#false} assume 0bv32 == __VERIFIER_assert_~cond; {93#false} is VALID [2020-07-28 18:14:40,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {93#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~y~0, 3bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {93#false} is VALID [2020-07-28 18:14:40,512 INFO L280 TraceCheckUtils]: 3: Hoare triple {127#(bvult ULTIMATE.start_main_~x~0 (_ bv6 32))} assume !~bvult32(main_~x~0, 6bv32); {93#false} is VALID [2020-07-28 18:14:40,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {127#(bvult ULTIMATE.start_main_~x~0 (_ bv6 32))} is VALID [2020-07-28 18:14:40,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {135#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv6 32))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {131#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2020-07-28 18:14:40,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 1bv32; {135#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv6 32))} is VALID [2020-07-28 18:14:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:14:40,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740235912] [2020-07-28 18:14:40,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:14:40,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-07-28 18:14:40,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445015785] [2020-07-28 18:14:40,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2020-07-28 18:14:40,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:14:40,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:14:40,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:14:40,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:14:40,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:14:40,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:14:40,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:14:40,577 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2020-07-28 18:14:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:14:40,916 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-28 18:14:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:14:40,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2020-07-28 18:14:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:14:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:14:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2020-07-28 18:14:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:14:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2020-07-28 18:14:40,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 19 transitions. [2020-07-28 18:14:41,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:14:41,005 INFO L225 Difference]: With dead ends: 16 [2020-07-28 18:14:41,005 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:14:41,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:14:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:14:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-28 18:14:41,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:14:41,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-28 18:14:41,031 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:14:41,031 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:14:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:14:41,036 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:14:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:14:41,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:14:41,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:14:41,037 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:14:41,037 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:14:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:14:41,039 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:14:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:14:41,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:14:41,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:14:41,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:14:41,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:14:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:14:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-07-28 18:14:41,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2020-07-28 18:14:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:14:41,045 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-07-28 18:14:41,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:14:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:14:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 18:14:41,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:14:41,046 INFO L422 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2020-07-28 18:14:41,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:14:41,260 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:14:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:14:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 2 times [2020-07-28 18:14:41,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:14:41,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33071238] [2020-07-28 18:14:41,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 18:14:41,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:14:41,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:14:41,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 18:14:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:14:41,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:14:41,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {208#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 1bv32; {213#(= (_ bv1 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:14:41,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {213#(= (_ bv1 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {217#(= (_ bv2 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:14:41,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {217#(= (_ bv2 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {221#(= (_ bv4 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:14:41,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {221#(= (_ bv4 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {225#(= (_ bv8 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:14:41,449 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#(= (_ bv8 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {229#(= (_ bv16 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:14:41,451 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(= (_ bv16 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {233#(= (_ bv32 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:14:41,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {233#(= (_ bv32 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {237#(= (_ bv64 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:14:41,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {237#(= (_ bv64 32) ULTIMATE.start_main_~y~0)} assume !~bvult32(main_~x~0, 6bv32); {237#(= (_ bv64 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:14:41,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {237#(= (_ bv64 32) ULTIMATE.start_main_~y~0)} __VERIFIER_assert_#in~cond := ~bvurem32(main_~y~0, 3bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {244#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:14:41,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {244#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {209#false} is VALID [2020-07-28 18:14:41,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {209#false} assume !false; {209#false} is VALID [2020-07-28 18:14:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:14:41,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:14:45,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {209#false} assume !false; {209#false} is VALID [2020-07-28 18:14:45,980 INFO L280 TraceCheckUtils]: 9: Hoare triple {254#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {209#false} is VALID [2020-07-28 18:14:45,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {258#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv3 32))))} __VERIFIER_assert_#in~cond := ~bvurem32(main_~y~0, 3bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {254#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:14:45,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {258#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv3 32))))} assume !~bvult32(main_~x~0, 6bv32); {258#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv3 32))))} is VALID [2020-07-28 18:14:45,983 INFO L280 TraceCheckUtils]: 6: Hoare triple {265#(not (= (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv2 32)) (_ bv3 32)) (_ bv0 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {258#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv3 32))))} is VALID [2020-07-28 18:14:46,227 INFO L280 TraceCheckUtils]: 5: Hoare triple {269#(not (= (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv4 32)) (_ bv3 32)) (_ bv0 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {265#(not (= (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv2 32)) (_ bv3 32)) (_ bv0 32)))} is VALID [2020-07-28 18:14:47,048 INFO L280 TraceCheckUtils]: 4: Hoare triple {273#(not (= (_ bv0 32) (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv8 32)) (_ bv3 32))))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {269#(not (= (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv4 32)) (_ bv3 32)) (_ bv0 32)))} is VALID [2020-07-28 18:14:47,755 INFO L280 TraceCheckUtils]: 3: Hoare triple {277#(not (= (_ bv0 32) (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv16 32)) (_ bv3 32))))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {273#(not (= (_ bv0 32) (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv8 32)) (_ bv3 32))))} is VALID [2020-07-28 18:14:48,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {281#(not (= (_ bv0 32) (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv32 32)) (_ bv3 32))))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {277#(not (= (_ bv0 32) (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv16 32)) (_ bv3 32))))} is VALID [2020-07-28 18:14:49,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {285#(not (= (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv64 32)) (_ bv3 32)) (_ bv0 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {281#(not (= (_ bv0 32) (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv32 32)) (_ bv3 32))))} is VALID [2020-07-28 18:14:49,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {208#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 1bv32; {285#(not (= (bvurem (bvmul ULTIMATE.start_main_~y~0 (_ bv64 32)) (_ bv3 32)) (_ bv0 32)))} is VALID [2020-07-28 18:14:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:14:49,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33071238] [2020-07-28 18:14:49,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:14:49,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-07-28 18:14:49,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307475261] [2020-07-28 18:14:49,197 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 11 [2020-07-28 18:14:49,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:14:49,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-28 18:14:51,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:14:51,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-28 18:14:51,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:14:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-28 18:14:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-07-28 18:14:51,250 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 18 states. [2020-07-28 18:14:55,152 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 37 [2020-07-28 18:15:01,361 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 32 [2020-07-28 18:15:05,760 WARN L193 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 40 [2020-07-28 18:15:10,308 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 27 [2020-07-28 18:15:14,552 WARN L193 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-28 18:15:18,496 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-28 18:15:22,938 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-28 18:15:25,665 WARN L193 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-07-28 18:15:28,737 WARN L193 SmtUtils]: Spent 857.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-07-28 18:15:31,263 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-07-28 18:15:33,443 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-28 18:15:35,396 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-07-28 18:15:36,622 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-07-28 18:15:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:37,047 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-28 18:15:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-28 18:15:37,047 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 11 [2020-07-28 18:15:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 18:15:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 45 transitions. [2020-07-28 18:15:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 18:15:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 45 transitions. [2020-07-28 18:15:37,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 45 transitions. [2020-07-28 18:15:48,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 41 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:48,135 INFO L225 Difference]: With dead ends: 38 [2020-07-28 18:15:48,135 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 18:15:48,136 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=295, Invalid=697, Unknown=0, NotChecked=0, Total=992 [2020-07-28 18:15:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 18:15:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-28 18:15:48,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:48,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-28 18:15:48,183 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 18:15:48,183 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 18:15:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:48,185 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-28 18:15:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-28 18:15:48,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:48,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:48,186 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 18:15:48,187 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 18:15:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:48,188 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-28 18:15:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-28 18:15:48,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:48,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:48,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:48,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 18:15:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-28 18:15:48,191 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2020-07-28 18:15:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:48,192 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-28 18:15:48,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-28 18:15:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-28 18:15:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 18:15:48,193 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:48,193 INFO L422 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2020-07-28 18:15:48,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:15:48,395 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 3 times [2020-07-28 18:15:48,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:15:48,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949472013] [2020-07-28 18:15:48,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 18:15:48,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2020-07-28 18:15:48,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:15:48,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 18:15:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:48,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:15:48,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {444#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 1bv32; {449#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:15:48,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {453#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:15:48,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {453#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {457#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:15:48,583 INFO L280 TraceCheckUtils]: 3: Hoare triple {457#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {461#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:15:48,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {461#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {465#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:15:48,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {465#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {469#(= (_ bv5 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:15:48,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {469#(= (_ bv5 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {473#(= (_ bv6 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:15:48,590 INFO L280 TraceCheckUtils]: 7: Hoare triple {473#(= (_ bv6 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,591 INFO L280 TraceCheckUtils]: 13: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,591 INFO L280 TraceCheckUtils]: 14: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,591 INFO L280 TraceCheckUtils]: 15: Hoare triple {445#false} assume !~bvult32(main_~x~0, 6bv32); {445#false} is VALID [2020-07-28 18:15:48,592 INFO L280 TraceCheckUtils]: 16: Hoare triple {445#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~y~0, 3bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {445#false} is VALID [2020-07-28 18:15:48,592 INFO L280 TraceCheckUtils]: 17: Hoare triple {445#false} assume 0bv32 == __VERIFIER_assert_~cond; {445#false} is VALID [2020-07-28 18:15:48,592 INFO L280 TraceCheckUtils]: 18: Hoare triple {445#false} assume !false; {445#false} is VALID [2020-07-28 18:15:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-28 18:15:48,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:15:48,828 INFO L280 TraceCheckUtils]: 18: Hoare triple {445#false} assume !false; {445#false} is VALID [2020-07-28 18:15:48,829 INFO L280 TraceCheckUtils]: 17: Hoare triple {445#false} assume 0bv32 == __VERIFIER_assert_~cond; {445#false} is VALID [2020-07-28 18:15:48,829 INFO L280 TraceCheckUtils]: 16: Hoare triple {445#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~y~0, 3bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {445#false} is VALID [2020-07-28 18:15:48,829 INFO L280 TraceCheckUtils]: 15: Hoare triple {445#false} assume !~bvult32(main_~x~0, 6bv32); {445#false} is VALID [2020-07-28 18:15:48,829 INFO L280 TraceCheckUtils]: 14: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,830 INFO L280 TraceCheckUtils]: 12: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,830 INFO L280 TraceCheckUtils]: 10: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,830 INFO L280 TraceCheckUtils]: 9: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {445#false} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {543#(not (bvult ULTIMATE.start_main_~x~0 (_ bv6 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {445#false} is VALID [2020-07-28 18:15:48,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {547#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv6 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {543#(not (bvult ULTIMATE.start_main_~x~0 (_ bv6 32)))} is VALID [2020-07-28 18:15:48,835 INFO L280 TraceCheckUtils]: 5: Hoare triple {551#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv6 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {547#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv6 32)))} is VALID [2020-07-28 18:15:48,838 INFO L280 TraceCheckUtils]: 4: Hoare triple {555#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv6 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {551#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv6 32)))} is VALID [2020-07-28 18:15:48,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {559#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv6 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {555#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv6 32)))} is VALID [2020-07-28 18:15:48,847 INFO L280 TraceCheckUtils]: 2: Hoare triple {563#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv5 32)) (_ bv6 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {559#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv6 32)))} is VALID [2020-07-28 18:15:48,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {567#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv6 32)) (_ bv6 32)))} assume !!~bvult32(main_~x~0, 6bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0;main_~y~0 := ~bvmul32(2bv32, main_~y~0); {563#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv5 32)) (_ bv6 32)))} is VALID [2020-07-28 18:15:48,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {444#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 1bv32; {567#(not (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv6 32)) (_ bv6 32)))} is VALID [2020-07-28 18:15:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-28 18:15:48,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949472013] [2020-07-28 18:15:48,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:15:48,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-07-28 18:15:48,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507928953] [2020-07-28 18:15:48,855 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2020-07-28 18:15:48,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:48,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-28 18:15:48,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:48,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-28 18:15:48,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:15:48,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-28 18:15:48,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:15:48,902 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 16 states. [2020-07-28 18:15:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:49,093 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-28 18:15:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 18:15:49,093 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2020-07-28 18:15:49,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:15:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2020-07-28 18:15:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:15:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2020-07-28 18:15:49,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 13 transitions. [2020-07-28 18:15:49,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:49,136 INFO L225 Difference]: With dead ends: 20 [2020-07-28 18:15:49,136 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:15:49,137 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:15:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:15:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:15:49,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:49,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:49,138 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:49,138 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:49,138 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:15:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:49,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:49,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:49,139 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:49,139 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:49,139 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:15:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:49,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:49,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:49,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:49,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:15:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:15:49,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-07-28 18:15:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:49,141 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:15:49,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-28 18:15:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:49,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:49,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:15:49,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:15:49,536 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-07-28 18:15:49,542 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:15:49,542 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 18:15:49,542 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:15:49,542 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:15:49,542 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-28 18:15:49,543 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 17) the Hoare annotation is: (or (and (= (_ bv5 32) ULTIMATE.start_main_~x~0) (= (_ bv32 32) ULTIMATE.start_main_~y~0)) (and (= (_ bv4 32) ULTIMATE.start_main_~y~0) (= (_ bv2 32) ULTIMATE.start_main_~x~0)) (and (= (_ bv2 32) ULTIMATE.start_main_~y~0) (= (_ bv1 32) ULTIMATE.start_main_~x~0)) (and (= (_ bv3 32) ULTIMATE.start_main_~x~0) (= (_ bv8 32) ULTIMATE.start_main_~y~0)) (and (= (_ bv16 32) ULTIMATE.start_main_~y~0) (= (_ bv4 32) ULTIMATE.start_main_~x~0)) (and (= (_ bv6 32) ULTIMATE.start_main_~x~0) (= (_ bv64 32) ULTIMATE.start_main_~y~0)) (and (= (_ bv1 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))) [2020-07-28 18:15:49,543 INFO L268 CegarLoopResult]: For program point L14-3(lines 14 17) no Hoare annotation was computed. [2020-07-28 18:15:49,543 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-28 18:15:49,543 INFO L271 CegarLoopResult]: At program point L4-2(lines 1 20) the Hoare annotation is: true [2020-07-28 18:15:49,546 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:15:49,547 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-28 18:15:49,547 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-28 18:15:49,551 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-28 18:15:49,552 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:15:49,552 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:15:49,552 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:15:49,552 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:15:49,552 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:15:49,552 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:15:49,552 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:15:49,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:15:49 BoogieIcfgContainer [2020-07-28 18:15:49,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:15:49,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:15:49,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:15:49,565 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:15:49,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:14:39" (3/4) ... [2020-07-28 18:15:49,569 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:15:49,577 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:15:49,578 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:15:49,614 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:15:49,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:15:49,617 INFO L168 Benchmark]: Toolchain (without parser) took 70987.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:49,617 INFO L168 Benchmark]: CDTParser took 0.25 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 18:15:49,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.16 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.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 18:15:49,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:49,619 INFO L168 Benchmark]: Boogie Preprocessor took 20.72 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 18:15:49,620 INFO L168 Benchmark]: RCFGBuilder took 328.04 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:49,621 INFO L168 Benchmark]: TraceAbstraction took 70183.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:49,621 INFO L168 Benchmark]: Witness Printer took 49.70 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:49,625 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.25 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 302.16 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.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 91.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.72 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 328.04 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 70183.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * Witness Printer took 49.70 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((5bv32 == x && 32bv32 == y) || (4bv32 == y && 2bv32 == x)) || (2bv32 == y && 1bv32 == x)) || (3bv32 == x && 8bv32 == y)) || (16bv32 == y && 4bv32 == x)) || (6bv32 == x && 64bv32 == y)) || (1bv32 == y && 0bv32 == x) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 69.8s, OverallIterations: 4, TraceHistogramMax: 14, AutomataDifference: 57.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 SDtfs, 58 SDslu, 60 SDs, 0 SdLazy, 172 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 42.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 51 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 2660 SizeOfPredicates, 5 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 168/258 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...