./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2a071cc6090a217f48ed180b566a651717a8e39 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -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 d2a071cc6090a217f48ed180b566a651717a8e39 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:07:14,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:07:14,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:07:14,178 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:07:14,178 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:07:14,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:07:14,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:07:14,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:07:14,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:07:14,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:07:14,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:07:14,186 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:07:14,188 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:07:14,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:07:14,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:07:14,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:07:14,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:07:14,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:07:14,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:07:14,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:07:14,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:07:14,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:07:14,204 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:07:14,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:07:14,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:07:14,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:07:14,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:07:14,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:07:14,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:07:14,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:07:14,210 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:07:14,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:07:14,211 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:07:14,211 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:07:14,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:07:14,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:07:14,214 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:07:14,230 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:07:14,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:07:14,231 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:07:14,231 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:07:14,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:07:14,232 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:07:14,232 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:07:14,232 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:07:14,232 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:07:14,232 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:07:14,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:07:14,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:07:14,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:07:14,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:07:14,234 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:07:14,234 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:07:14,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:07:14,235 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:07:14,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:07:14,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:07:14,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:07:14,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:07:14,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:07:14,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:07:14,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:07:14,237 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:07:14,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:07:14,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:07:14,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:07:14,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:07:14,238 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-11-28 16:07:14,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:07:14,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:07:14,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:07:14,305 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:07:14,306 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:07:14,307 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-28 16:07:14,377 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2cd4fd08/856ed4476d304387a638308debe17d20/FLAGaa9e36277 [2018-11-28 16:07:14,847 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:07:14,850 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-28 16:07:14,857 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2cd4fd08/856ed4476d304387a638308debe17d20/FLAGaa9e36277 [2018-11-28 16:07:15,205 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2cd4fd08/856ed4476d304387a638308debe17d20 [2018-11-28 16:07:15,209 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:07:15,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:07:15,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:07:15,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:07:15,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:07:15,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1b49a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15, skipping insertion in model container [2018-11-28 16:07:15,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:07:15,251 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:07:15,472 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:07:15,481 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:07:15,506 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:07:15,530 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:07:15,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15 WrapperNode [2018-11-28 16:07:15,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:07:15,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:07:15,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:07:15,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:07:15,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:07:15,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:07:15,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:07:15,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:07:15,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (1/1) ... [2018-11-28 16:07:15,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:07:15,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:07:15,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:07:15,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:07:15,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (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 [2018-11-28 16:07:15,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:07:15,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:07:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:07:15,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:07:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:07:15,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:07:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 16:07:15,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 16:07:15,967 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:07:15,968 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:07:15,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:07:15 BoogieIcfgContainer [2018-11-28 16:07:15,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:07:15,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:07:15,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:07:15,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:07:15,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:07:15" (1/3) ... [2018-11-28 16:07:15,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64adbe2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:07:15, skipping insertion in model container [2018-11-28 16:07:15,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:15" (2/3) ... [2018-11-28 16:07:15,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64adbe2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:07:15, skipping insertion in model container [2018-11-28 16:07:15,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:07:15" (3/3) ... [2018-11-28 16:07:15,983 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-28 16:07:15,999 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:07:16,009 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:07:16,031 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:07:16,074 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:07:16,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:07:16,078 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:07:16,078 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:07:16,078 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:07:16,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:07:16,078 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:07:16,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:07:16,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:07:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-28 16:07:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 16:07:16,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:16,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:16,117 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:16,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-28 16:07:16,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:16,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:16,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:16,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:16,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:07:16,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 16:07:16,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 16:07:16,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 16:07:16,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 16:07:16,261 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-28 16:07:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:16,281 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-28 16:07:16,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 16:07:16,283 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 16:07:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:16,291 INFO L225 Difference]: With dead ends: 32 [2018-11-28 16:07:16,291 INFO L226 Difference]: Without dead ends: 13 [2018-11-28 16:07:16,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 16:07:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-28 16:07:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 16:07:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 16:07:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-28 16:07:16,339 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-28 16:07:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:16,339 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-28 16:07:16,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 16:07:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-28 16:07:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 16:07:16,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:16,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:16,343 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:16,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-11-28 16:07:16,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:16,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:16,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:16,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:07:16,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:07:16,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:07:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:07:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:07:16,497 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-28 16:07:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:16,556 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-28 16:07:16,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:07:16,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 16:07:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:16,557 INFO L225 Difference]: With dead ends: 21 [2018-11-28 16:07:16,557 INFO L226 Difference]: Without dead ends: 16 [2018-11-28 16:07:16,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:07:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-28 16:07:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-28 16:07:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 16:07:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-28 16:07:16,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-28 16:07:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:16,563 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-28 16:07:16,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:07:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-28 16:07:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 16:07:16,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:16,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:16,564 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:16,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-11-28 16:07:16,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:16,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:16,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:16,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:16,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:16,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:07:16,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:07:16,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:16,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:16,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:16,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 16:07:16,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:07:16,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:07:16,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:07:16,829 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-28 16:07:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:16,878 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-28 16:07:16,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:07:16,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 16:07:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:16,880 INFO L225 Difference]: With dead ends: 24 [2018-11-28 16:07:16,880 INFO L226 Difference]: Without dead ends: 19 [2018-11-28 16:07:16,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:07:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-28 16:07:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-28 16:07:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 16:07:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 16:07:16,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-11-28 16:07:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:16,886 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 16:07:16,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:07:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-28 16:07:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 16:07:16,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:16,887 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:16,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:16,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1182180650, now seen corresponding path program 2 times [2018-11-28 16:07:16,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:16,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:16,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:17,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:07:17,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:07:17,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 16:07:17,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 16:07:17,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:17,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:17,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:17,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 16:07:17,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:07:17,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:07:17,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:07:17,448 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2018-11-28 16:07:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:17,555 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-28 16:07:17,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 16:07:17,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 16:07:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:17,559 INFO L225 Difference]: With dead ends: 27 [2018-11-28 16:07:17,559 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 16:07:17,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:07:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 16:07:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 16:07:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 16:07:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 16:07:17,565 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2018-11-28 16:07:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:17,566 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 16:07:17,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:07:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-28 16:07:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:07:17,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:17,567 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:17,567 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:17,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2055818357, now seen corresponding path program 3 times [2018-11-28 16:07:17,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:17,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:17,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:17,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:07:17,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:17,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:07:17,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:07:17,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 16:07:17,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 16:07:17,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:17,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:17,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:17,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-28 16:07:17,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 16:07:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 16:07:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:07:17,934 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 9 states. [2018-11-28 16:07:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:18,138 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-28 16:07:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 16:07:18,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-28 16:07:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:18,141 INFO L225 Difference]: With dead ends: 30 [2018-11-28 16:07:18,142 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 16:07:18,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:07:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 16:07:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-28 16:07:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 16:07:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 16:07:18,149 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2018-11-28 16:07:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:18,150 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 16:07:18,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 16:07:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-28 16:07:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:07:18,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:18,151 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:18,151 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:18,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 4 times [2018-11-28 16:07:18,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:18,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:07:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:18,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:07:18,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:07:18,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 16:07:18,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 16:07:18,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:18,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:18,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:18,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-28 16:07:18,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 16:07:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 16:07:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:07:18,627 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 11 states. [2018-11-28 16:07:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:19,011 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-28 16:07:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 16:07:19,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-28 16:07:19,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:19,013 INFO L225 Difference]: With dead ends: 33 [2018-11-28 16:07:19,014 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 16:07:19,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:07:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 16:07:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-28 16:07:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 16:07:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-28 16:07:19,021 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2018-11-28 16:07:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:19,021 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 16:07:19,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 16:07:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-28 16:07:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:07:19,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:19,023 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:19,023 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:19,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1904607445, now seen corresponding path program 5 times [2018-11-28 16:07:19,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:19,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:19,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:07:19,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:19,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:07:19,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:07:19,228 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 16:07:19,260 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 16:07:19,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:19,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:19,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:19,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-28 16:07:19,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 16:07:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 16:07:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-28 16:07:19,661 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 13 states. [2018-11-28 16:07:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:19,985 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-28 16:07:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 16:07:19,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-28 16:07:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:19,988 INFO L225 Difference]: With dead ends: 36 [2018-11-28 16:07:19,988 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 16:07:19,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-28 16:07:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 16:07:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-28 16:07:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 16:07:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-28 16:07:20,000 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2018-11-28 16:07:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:20,001 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-28 16:07:20,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 16:07:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-28 16:07:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:07:20,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:20,003 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:20,003 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:20,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:20,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1015181846, now seen corresponding path program 6 times [2018-11-28 16:07:20,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:20,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:20,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:20,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:07:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:20,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:07:20,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:07:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 16:07:20,238 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 16:07:20,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:20,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:20,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:20,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-28 16:07:20,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 16:07:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 16:07:20,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-28 16:07:20,537 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 15 states. [2018-11-28 16:07:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:20,874 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-28 16:07:20,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:07:20,880 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-28 16:07:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:20,881 INFO L225 Difference]: With dead ends: 39 [2018-11-28 16:07:20,881 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 16:07:20,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-28 16:07:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 16:07:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-28 16:07:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 16:07:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-28 16:07:20,889 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2018-11-28 16:07:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:20,889 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-28 16:07:20,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 16:07:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-28 16:07:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:07:20,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:20,890 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:20,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:20,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash -209588939, now seen corresponding path program 7 times [2018-11-28 16:07:20,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:20,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:20,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:07:20,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:21,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:07:21,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:07:21,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:21,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:21,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:21,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-28 16:07:21,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 16:07:21,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 16:07:21,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-28 16:07:21,615 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 17 states. [2018-11-28 16:07:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:21,932 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-28 16:07:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 16:07:21,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-11-28 16:07:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:21,934 INFO L225 Difference]: With dead ends: 42 [2018-11-28 16:07:21,935 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 16:07:21,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-28 16:07:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 16:07:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-28 16:07:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 16:07:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-28 16:07:21,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 31 [2018-11-28 16:07:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:21,943 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-28 16:07:21,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 16:07:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-28 16:07:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 16:07:21,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:21,945 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:21,945 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:21,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1608865354, now seen corresponding path program 8 times [2018-11-28 16:07:21,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:21,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:21,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 16:07:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 16:07:22,006 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 16:07:22,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:07:22 BoogieIcfgContainer [2018-11-28 16:07:22,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:07:22,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:07:22,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:07:22,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:07:22,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:07:15" (3/4) ... [2018-11-28 16:07:22,060 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 16:07:22,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:07:22,061 INFO L168 Benchmark]: Toolchain (without parser) took 6851.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:22,063 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:22,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.06 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:22,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.40 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:22,066 INFO L168 Benchmark]: Boogie Preprocessor took 45.56 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:22,066 INFO L168 Benchmark]: RCFGBuilder took 359.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:22,068 INFO L168 Benchmark]: TraceAbstraction took 6085.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:22,069 INFO L168 Benchmark]: Witness Printer took 5.30 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. [2018-11-28 16:07:22,075 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.06 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 30.40 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.56 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 359.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6085.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.30 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 22, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 VAL [c=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=0, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=0, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=1, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=1, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=1, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=2, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=2, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=2, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=3, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=3, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=3, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=4, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=4, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=4, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=5, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=5, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=5, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=6, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=6, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=6, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=7, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=7, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=7, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=8, i=0, x=37, y=0] [L21] COND FALSE !(c < (unsigned char)8) VAL [bit=1, c=8, i=0, x=37, y=0] [L29] CALL __VERIFIER_assert(x == y) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 5.9s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 130 SDslu, 914 SDs, 0 SdLazy, 667 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 124 SyntacticMatches, 13 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 312 ConstructedInterpolants, 70 QuantifiedInterpolants, 68271 SizeOfPredicates, 11 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-91b1670 [2018-11-28 16:07:24,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:07:24,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:07:24,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:07:24,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:07:24,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:07:24,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:07:24,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:07:24,569 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:07:24,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:07:24,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:07:24,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:07:24,577 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:07:24,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:07:24,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:07:24,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:07:24,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:07:24,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:07:24,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:07:24,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:07:24,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:07:24,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:07:24,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:07:24,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:07:24,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:07:24,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:07:24,598 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:07:24,599 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:07:24,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:07:24,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:07:24,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:07:24,602 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:07:24,602 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:07:24,602 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:07:24,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:07:24,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:07:24,604 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 16:07:24,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:07:24,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:07:24,627 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:07:24,627 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:07:24,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:07:24,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:07:24,630 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:07:24,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:07:24,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:07:24,632 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:07:24,632 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:07:24,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:07:24,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:07:24,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:07:24,633 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 16:07:24,633 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 16:07:24,633 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:07:24,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:07:24,633 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:07:24,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:07:24,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:07:24,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:07:24,635 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:07:24,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:07:24,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:07:24,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:07:24,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:07:24,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:07:24,636 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 16:07:24,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:07:24,637 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 16:07:24,637 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 16:07:24,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-11-28 16:07:24,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:07:24,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:07:24,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:07:24,703 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:07:24,703 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:07:24,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-28 16:07:24,763 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b6e8ce2/35dcdd896bdc4f59a1671117be20a880/FLAG343c3206e [2018-11-28 16:07:25,219 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:07:25,219 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-28 16:07:25,225 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b6e8ce2/35dcdd896bdc4f59a1671117be20a880/FLAG343c3206e [2018-11-28 16:07:25,600 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6b6e8ce2/35dcdd896bdc4f59a1671117be20a880 [2018-11-28 16:07:25,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:07:25,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:07:25,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:07:25,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:07:25,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:07:25,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cb709d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25, skipping insertion in model container [2018-11-28 16:07:25,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:07:25,650 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:07:25,830 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:07:25,837 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:07:25,859 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:07:25,878 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:07:25,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25 WrapperNode [2018-11-28 16:07:25,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:07:25,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:07:25,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:07:25,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:07:25,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:07:25,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:07:25,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:07:25,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:07:25,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (1/1) ... [2018-11-28 16:07:25,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:07:25,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:07:25,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:07:25,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:07:25,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (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 [2018-11-28 16:07:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:07:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:07:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:07:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:07:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:07:26,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:07:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 16:07:26,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 16:07:26,340 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:07:26,340 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:07:26,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:07:26 BoogieIcfgContainer [2018-11-28 16:07:26,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:07:26,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:07:26,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:07:26,350 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:07:26,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:07:25" (1/3) ... [2018-11-28 16:07:26,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6822f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:07:26, skipping insertion in model container [2018-11-28 16:07:26,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:07:25" (2/3) ... [2018-11-28 16:07:26,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6822f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:07:26, skipping insertion in model container [2018-11-28 16:07:26,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:07:26" (3/3) ... [2018-11-28 16:07:26,357 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-28 16:07:26,371 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:07:26,381 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:07:26,401 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:07:26,436 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:07:26,437 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:07:26,437 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:07:26,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:07:26,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:07:26,438 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:07:26,438 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:07:26,438 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:07:26,438 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:07:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-28 16:07:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 16:07:26,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:26,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:26,485 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:26,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-28 16:07:26,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:26,495 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:26,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:26,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:26,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 16:07:26,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:07:26,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 16:07:26,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 16:07:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 16:07:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 16:07:26,601 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-28 16:07:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:26,626 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-28 16:07:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 16:07:26,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 16:07:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:26,637 INFO L225 Difference]: With dead ends: 32 [2018-11-28 16:07:26,638 INFO L226 Difference]: Without dead ends: 13 [2018-11-28 16:07:26,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 16:07:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-28 16:07:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 16:07:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 16:07:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-28 16:07:26,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-28 16:07:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:26,682 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-28 16:07:26,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 16:07:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-28 16:07:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 16:07:26,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:26,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:26,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:26,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-11-28 16:07:26,685 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:26,685 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:26,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:26,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:26,772 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 16:07:26,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:07:26,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:07:26,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:07:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:07:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:07:26,778 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-28 16:07:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:26,815 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-28 16:07:26,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:07:26,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 16:07:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:26,817 INFO L225 Difference]: With dead ends: 21 [2018-11-28 16:07:26,817 INFO L226 Difference]: Without dead ends: 16 [2018-11-28 16:07:26,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:07:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-28 16:07:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-28 16:07:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 16:07:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-28 16:07:26,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-28 16:07:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:26,824 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-28 16:07:26,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:07:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-28 16:07:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 16:07:26,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:26,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:26,825 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:26,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-11-28 16:07:26,826 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:26,826 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:26,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:07:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:26,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:26,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 16:07:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:26,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:26,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-28 16:07:26,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 16:07:26,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 16:07:26,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:07:26,978 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-11-28 16:07:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:27,139 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-28 16:07:27,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 16:07:27,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-28 16:07:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:27,141 INFO L225 Difference]: With dead ends: 28 [2018-11-28 16:07:27,141 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 16:07:27,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:07:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 16:07:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 16:07:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 16:07:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 16:07:27,151 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2018-11-28 16:07:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:27,152 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 16:07:27,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 16:07:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-28 16:07:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:07:27,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:27,154 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:27,154 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:27,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 2 times [2018-11-28 16:07:27,155 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:27,156 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:27,184 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 16:07:27,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 16:07:27,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:27,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 16:07:27,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 16:07:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 16:07:27,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:27,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 16:07:27,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:07:27,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:07:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:07:27,465 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2018-11-28 16:07:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:28,194 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-28 16:07:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 16:07:28,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 16:07:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:28,197 INFO L225 Difference]: With dead ends: 45 [2018-11-28 16:07:28,198 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 16:07:28,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:07:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 16:07:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-28 16:07:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 16:07:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-28 16:07:28,207 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2018-11-28 16:07:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:28,207 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 16:07:28,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:07:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-28 16:07:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:07:28,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:28,208 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:28,209 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:28,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:28,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1506969082, now seen corresponding path program 1 times [2018-11-28 16:07:28,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:28,210 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:28,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:07:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:07:28,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:28,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 16:07:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:28,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:28,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-28 16:07:28,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 16:07:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 16:07:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:07:28,619 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 12 states. [2018-11-28 16:07:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:29,112 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-28 16:07:29,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 16:07:29,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-28 16:07:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:29,116 INFO L225 Difference]: With dead ends: 40 [2018-11-28 16:07:29,116 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 16:07:29,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-28 16:07:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 16:07:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-28 16:07:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 16:07:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-28 16:07:29,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 22 [2018-11-28 16:07:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:29,127 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-28 16:07:29,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 16:07:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-28 16:07:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 16:07:29,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:29,129 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:29,130 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:29,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1137706810, now seen corresponding path program 2 times [2018-11-28 16:07:29,131 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:29,152 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 16:07:29,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 16:07:29,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:29,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 16:07:29,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 16:07:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 16:07:29,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:29,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-28 16:07:29,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 16:07:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 16:07:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-28 16:07:29,568 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 13 states. [2018-11-28 16:07:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:30,449 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-11-28 16:07:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 16:07:30,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-28 16:07:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:30,458 INFO L225 Difference]: With dead ends: 69 [2018-11-28 16:07:30,458 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 16:07:30,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-28 16:07:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 16:07:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-11-28 16:07:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 16:07:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-28 16:07:30,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2018-11-28 16:07:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:30,476 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-28 16:07:30,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 16:07:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-28 16:07:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 16:07:30,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:30,478 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:30,479 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:30,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:30,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1498618808, now seen corresponding path program 3 times [2018-11-28 16:07:30,480 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:30,480 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:30,502 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-28 16:07:30,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-28 16:07:30,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:30,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 16:07:31,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 16:07:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 16:07:33,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:33,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-11-28 16:07:33,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-28 16:07:33,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 16:07:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 16:07:33,623 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 34 states. [2018-11-28 16:07:37,744 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-11-28 16:07:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:37,846 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-28 16:07:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 16:07:37,848 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-11-28 16:07:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:37,852 INFO L225 Difference]: With dead ends: 118 [2018-11-28 16:07:37,852 INFO L226 Difference]: Without dead ends: 113 [2018-11-28 16:07:37,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=431, Invalid=2875, Unknown=0, NotChecked=0, Total=3306 [2018-11-28 16:07:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-28 16:07:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2018-11-28 16:07:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 16:07:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2018-11-28 16:07:37,877 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 34 [2018-11-28 16:07:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:37,878 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2018-11-28 16:07:37,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-28 16:07:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2018-11-28 16:07:37,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 16:07:37,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:37,879 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:37,880 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:37,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:37,880 INFO L82 PathProgramCache]: Analyzing trace with hash 911812794, now seen corresponding path program 4 times [2018-11-28 16:07:37,880 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:37,902 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 16:07:37,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 16:07:37,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:37,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:38,043 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 16:07:38,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 16:07:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 16:07:38,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:07:38,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-28 16:07:38,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 16:07:38,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 16:07:38,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-28 16:07:38,248 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 16 states. [2018-11-28 16:07:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:38,541 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-28 16:07:38,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 16:07:38,542 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-28 16:07:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:38,543 INFO L225 Difference]: With dead ends: 103 [2018-11-28 16:07:38,543 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 16:07:38,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-11-28 16:07:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 16:07:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-28 16:07:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 16:07:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-28 16:07:38,553 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 34 [2018-11-28 16:07:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:38,554 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-28 16:07:38,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 16:07:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-28 16:07:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 16:07:38,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:38,555 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:38,555 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:38,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1684357419, now seen corresponding path program 5 times [2018-11-28 16:07:38,556 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 16:07:38,556 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 16:07:38,587 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-28 16:07:38,654 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-28 16:07:38,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:38,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:39,636 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 16:07:39,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:07:39,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 16:07:39,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 16:07:39,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 16:07:39,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-11-28 16:07:39,640 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 18 states. [2018-11-28 16:07:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:40,322 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-28 16:07:40,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 16:07:40,323 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-11-28 16:07:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:40,324 INFO L225 Difference]: With dead ends: 42 [2018-11-28 16:07:40,324 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:07:40,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-11-28 16:07:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:07:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:07:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:07:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:07:40,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-28 16:07:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:40,326 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:07:40,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 16:07:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:07:40,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:07:40,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:07:40,507 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 175 [2018-11-28 16:07:40,712 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2018-11-28 16:07:41,504 WARN L180 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 115 [2018-11-28 16:07:41,508 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:07:41,508 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:07:41,509 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:07:41,509 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:07:41,509 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:07:41,509 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:07:41,509 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 12 32) the Hoare annotation is: true [2018-11-28 16:07:41,509 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-28 16:07:41,509 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 12 32) no Hoare annotation was computed. [2018-11-28 16:07:41,509 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-28 16:07:41,510 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2018-11-28 16:07:41,510 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 28) the Hoare annotation is: (let ((.cse12 (= (_ bv1 8) main_~y~0)) (.cse13 (not (= ((_ zero_extend 24) main_~bit~0) (_ bv0 32)))) (.cse11 (= (_ bv5 8) main_~y~0)) (.cse1 (= (_ bv0 8) main_~bit~0)) (.cse0 (= (_ bv37 8) main_~x~0)) (.cse9 ((_ zero_extend 24) main_~c~0))) (or (and .cse0 .cse1 (exists ((v_main_~c~0_67 (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) v_main_~c~0_67))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv1 32)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 (_ bv1 32)))))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 (_ bv1 32)))))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (_ bv1 32)))))) (and (bvslt .cse2 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse3 (_ bv1 32))) main_~c~0) (bvslt .cse4 (_ bv8 32)) (bvslt .cse5 (_ bv8 32)) (bvslt .cse6 (_ bv8 32)) (bvslt .cse7 (_ bv8 32)) (bvslt .cse8 (_ bv8 32)) (bvslt .cse3 (_ bv8 32))))))))))) (bvslt .cse9 (_ bv8 32)) (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) v_main_~c~0_41))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 (_ bv1 32)))) (_ bv1 32))) main_~c~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse10))) (_ bv5 32))) main_~y~0))))) (and .cse0 .cse1 (= (_ bv5 8) main_~c~0) .cse11) (and (= (_ bv0 8) main_~c~0) .cse0 (= (_ bv0 8) main_~y~0)) (and .cse0 .cse1 .cse12 (= (_ bv2 8) main_~c~0)) (and .cse0 .cse1 .cse11 (= (_ bv4 8) main_~c~0)) (and .cse0 (= (_ bv1 8) main_~c~0) .cse13 .cse12) (and .cse0 .cse13 .cse11 (= (_ bv3 8) main_~c~0)) (and .cse0 (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) v_main_~c~0_41))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 (_ bv1 32)))) (_ bv1 32)))))) (and (bvslt .cse14 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15))) (_ bv5 32))) main_~y~0) (= main_~c~0 ((_ extract 7 0) (bvadd .cse14 (_ bv1 32)))))))) .cse1 (exists ((v_main_~c~0_67 (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) v_main_~c~0_67))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (_ bv1 32)))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 (_ bv1 32)))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 (_ bv1 32)))))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 (_ bv1 32)))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (_ bv1 32)))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 (_ bv1 32)))))) (and (bvslt .cse16 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse17 (_ bv1 32))) main_~c~0) (bvslt .cse18 (_ bv8 32)) (bvslt .cse17 (_ bv8 32)) (bvslt .cse19 (_ bv8 32)) (bvslt .cse20 (_ bv8 32)) (bvslt .cse21 (_ bv8 32)) (bvslt .cse22 (_ bv8 32)) (bvslt .cse23 (_ bv8 32))))))))))))) (and .cse0 (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) v_main_~c~0_41))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24))) (_ bv5 32))) main_~y~0) (= ((_ extract 7 0) (bvadd .cse24 (_ bv1 32))) main_~c~0)))) (= (_ bv32 8) main_~bit~0) (exists ((v_main_~c~0_67 (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) v_main_~c~0_67))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 (_ bv1 32)))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 (_ bv1 32)))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 (_ bv1 32)))))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 (_ bv1 32)))))) (and (bvslt .cse25 (_ bv8 32)) (bvslt .cse26 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse27 (_ bv1 32))) main_~c~0) (bvslt .cse28 (_ bv8 32)) (bvslt .cse29 (_ bv8 32)) (bvslt .cse27 (_ bv8 32)) (bvslt .cse30 (_ bv8 32)))))))))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))) (_ bv8 32))))) [2018-11-28 16:07:41,514 INFO L444 ceAbstractionStarter]: At program point L21-3(lines 21 28) the Hoare annotation is: (and (= (_ bv37 8) main_~x~0) (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse1 ((_ zero_extend 24) v_main_~c~0_41))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse1 (_ bv1 32)))) (_ bv1 32)))))) (and (bvslt .cse0 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse1))) (_ bv5 32))) main_~y~0) (not (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse0 (_ bv1 32)))) (_ bv8 32))))))) (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse3 ((_ zero_extend 24) v_main_~c~0_41))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 (_ bv1 32)))) (_ bv1 32)))))) (and (bvslt .cse2 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse3))) (_ bv5 32))) main_~y~0) (= main_~c~0 ((_ extract 7 0) (bvadd .cse2 (_ bv1 32))))))))) [2018-11-28 16:07:41,514 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 12 32) no Hoare annotation was computed. [2018-11-28 16:07:41,514 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-28 16:07:41,515 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-28 16:07:41,516 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-28 16:07:41,516 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-28 16:07:41,516 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-28 16:07:41,516 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-28 16:07:41,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,535 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,535 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,536 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:07:41 BoogieIcfgContainer [2018-11-28 16:07:41,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:07:41,593 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:07:41,593 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:07:41,593 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:07:41,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:07:26" (3/4) ... [2018-11-28 16:07:41,601 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:07:41,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:07:41,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:07:41,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 16:07:41,616 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 16:07:41,617 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 16:07:41,617 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:07:41,647 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((37bv8 == x && 0bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (\exists v_main_~c~0_41 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == c) && 5bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((37bv8 == x && 0bv8 == bit) && 1bv8 == y) && 2bv8 == c)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == y) && 4bv8 == c)) || (((37bv8 == x && 1bv8 == c) && !(~zero_extendFrom8To32(bit) == 0bv32)) && 1bv8 == y)) || (((37bv8 == x && !(~zero_extendFrom8To32(bit) == 0bv32)) && 5bv8 == y) && 3bv8 == c)) || (((37bv8 == x && (\exists v_main_~c~0_41 : bv8 :: (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0])) && 0bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || ((((37bv8 == x && (\exists v_main_~c~0_41 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y && ~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0] == c)) && 32bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: (((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32)) [2018-11-28 16:07:41,665 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:07:41,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:07:41,666 INFO L168 Benchmark]: Toolchain (without parser) took 16060.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:41,667 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:41,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.71 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:41,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.53 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:41,668 INFO L168 Benchmark]: Boogie Preprocessor took 30.04 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:41,669 INFO L168 Benchmark]: RCFGBuilder took 401.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:41,669 INFO L168 Benchmark]: TraceAbstraction took 15250.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 177.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:41,670 INFO L168 Benchmark]: Witness Printer took 71.86 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:41,674 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.71 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 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 28.53 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.04 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 401.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15250.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 177.7 MB. Max. memory is 11.5 GB. * Witness Printer took 71.86 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 21]: Loop Invariant [2018-11-28 16:07:41,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-11-28 16:07:41,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-11-28 16:07:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] Derived loop invariant: (((((((((((37bv8 == x && 0bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (\exists v_main_~c~0_41 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == c) && 5bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((37bv8 == x && 0bv8 == bit) && 1bv8 == y) && 2bv8 == c)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == y) && 4bv8 == c)) || (((37bv8 == x && 1bv8 == c) && !(~zero_extendFrom8To32(bit) == 0bv32)) && 1bv8 == y)) || (((37bv8 == x && !(~zero_extendFrom8To32(bit) == 0bv32)) && 5bv8 == y) && 3bv8 == c)) || (((37bv8 == x && (\exists v_main_~c~0_41 : bv8 :: (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0])) && 0bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || ((((37bv8 == x && (\exists v_main_~c~0_41 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y && ~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0] == c)) && 32bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: (((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 15.0s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 198 SDslu, 762 SDs, 0 SdLazy, 1122 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 49 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 727 HoareAnnotationTreeSize, 15 FomulaSimplifications, 364 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 581 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 216 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 360 ConstructedInterpolants, 46 QuantifiedInterpolants, 152124 SizeOfPredicates, 24 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 409/759 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...