./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 0ed9222f 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-0ed9222-m [2019-01-11 21:13:31,061 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:13:31,062 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:13:31,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:13:31,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:13:31,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:13:31,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:13:31,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:13:31,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:13:31,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:13:31,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:13:31,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:13:31,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:13:31,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:13:31,094 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:13:31,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:13:31,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:13:31,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:13:31,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:13:31,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:13:31,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:13:31,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:13:31,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:13:31,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:13:31,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:13:31,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:13:31,117 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:13:31,118 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:13:31,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:13:31,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:13:31,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:13:31,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:13:31,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:13:31,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:13:31,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:13:31,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:13:31,128 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:13:31,149 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:13:31,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:13:31,150 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:13:31,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:13:31,150 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:13:31,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:13:31,151 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:13:31,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:13:31,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:13:31,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:13:31,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:13:31,152 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:13:31,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:13:31,153 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:13:31,153 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:13:31,153 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:13:31,153 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:13:31,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:13:31,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:13:31,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:13:31,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:13:31,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:13:31,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:13:31,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:13:31,157 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:13:31,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:13:31,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:13:31,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:13:31,157 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 [2019-01-11 21:13:31,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:13:31,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:13:31,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:13:31,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:13:31,213 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:13:31,214 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2019-01-11 21:13:31,273 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4f20863/a57d4ec3ad7a46aa81e1cc3aa54f364e/FLAG59e519406 [2019-01-11 21:13:31,700 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:13:31,701 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2019-01-11 21:13:31,707 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4f20863/a57d4ec3ad7a46aa81e1cc3aa54f364e/FLAG59e519406 [2019-01-11 21:13:32,047 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4f20863/a57d4ec3ad7a46aa81e1cc3aa54f364e [2019-01-11 21:13:32,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:13:32,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:13:32,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:13:32,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:13:32,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:13:32,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3240233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32, skipping insertion in model container [2019-01-11 21:13:32,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:13:32,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:13:32,327 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:13:32,335 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:13:32,355 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:13:32,372 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:13:32,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32 WrapperNode [2019-01-11 21:13:32,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:13:32,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:13:32,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:13:32,374 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:13:32,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:13:32,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:13:32,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:13:32,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:13:32,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (1/1) ... [2019-01-11 21:13:32,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:13:32,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:13:32,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:13:32,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:13:32,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (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 [2019-01-11 21:13:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:13:32,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:13:32,720 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:13:32,721 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:13:32,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:13:32 BoogieIcfgContainer [2019-01-11 21:13:32,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:13:32,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:13:32,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:13:32,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:13:32,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:13:32" (1/3) ... [2019-01-11 21:13:32,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0d8bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:13:32, skipping insertion in model container [2019-01-11 21:13:32,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:32" (2/3) ... [2019-01-11 21:13:32,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0d8bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:13:32, skipping insertion in model container [2019-01-11 21:13:32,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:13:32" (3/3) ... [2019-01-11 21:13:32,729 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2019-01-11 21:13:32,739 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:13:32,747 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:13:32,763 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:13:32,791 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:13:32,792 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:13:32,792 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:13:32,792 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:13:32,792 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:13:32,792 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:13:32,792 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:13:32,793 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:13:32,793 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:13:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-11 21:13:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 21:13:32,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:32,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 21:13:32,813 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:32,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2019-01-11 21:13:32,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:32,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:32,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:32,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:32,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:32,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:13:32,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:13:32,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-11 21:13:32,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-11 21:13:32,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-11 21:13:32,937 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-01-11 21:13:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:32,949 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-11 21:13:32,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-11 21:13:32,950 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-01-11 21:13:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:32,960 INFO L225 Difference]: With dead ends: 20 [2019-01-11 21:13:32,960 INFO L226 Difference]: Without dead ends: 8 [2019-01-11 21:13:32,963 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 [2019-01-11 21:13:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-11 21:13:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-11 21:13:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 21:13:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-11 21:13:32,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-01-11 21:13:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-11 21:13:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-11 21:13:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-11 21:13:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 21:13:32,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:32,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 21:13:32,997 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2019-01-11 21:13:32,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:32,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:32,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:32,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:33,230 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-01-11 21:13:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:33,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:13:33,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:13:33,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:13:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:13:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:13:33,234 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2019-01-11 21:13:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:33,261 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-11 21:13:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:13:33,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-11 21:13:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:33,263 INFO L225 Difference]: With dead ends: 15 [2019-01-11 21:13:33,263 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 21:13:33,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:13:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 21:13:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-11 21:13:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 21:13:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-11 21:13:33,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-01-11 21:13:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:33,270 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-11 21:13:33,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:13:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-11 21:13:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 21:13:33,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:33,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:13:33,271 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:33,272 INFO L82 PathProgramCache]: Analyzing trace with hash 608596189, now seen corresponding path program 1 times [2019-01-11 21:13:33,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:33,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:33,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:33,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:33,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:33,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:13:33,396 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 [2019-01-11 21:13:33,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:33,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:33,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:33,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-11 21:13:33,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:13:33,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:13:33,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:13:33,552 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-11 21:13:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:33,594 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-11 21:13:33,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:13:33,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 21:13:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:33,595 INFO L225 Difference]: With dead ends: 18 [2019-01-11 21:13:33,596 INFO L226 Difference]: Without dead ends: 14 [2019-01-11 21:13:33,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:13:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-11 21:13:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-11 21:13:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 21:13:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-11 21:13:33,603 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2019-01-11 21:13:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:33,603 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-11 21:13:33,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:13:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-11 21:13:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 21:13:33,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:33,604 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-11 21:13:33,604 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1123862993, now seen corresponding path program 2 times [2019-01-11 21:13:33,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:33,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:33,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:33,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:13:33,847 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 [2019-01-11 21:13:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-11 21:13:33,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-11 21:13:33,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:33,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:34,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:34,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-11 21:13:34,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:13:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:13:34,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:13:34,104 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-11 21:13:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:34,198 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-01-11 21:13:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:13:34,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-11 21:13:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:34,201 INFO L225 Difference]: With dead ends: 21 [2019-01-11 21:13:34,201 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 21:13:34,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:13:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 21:13:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-01-11 21:13:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 21:13:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-11 21:13:34,206 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2019-01-11 21:13:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:34,207 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-11 21:13:34,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:13:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-01-11 21:13:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:13:34,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:34,208 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2019-01-11 21:13:34,208 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash -193357923, now seen corresponding path program 3 times [2019-01-11 21:13:34,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:34,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:34,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:34,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:13:34,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:34,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:13:34,378 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 [2019-01-11 21:13:34,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 21:13:34,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 21:13:34,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:34,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:34,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:34,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-11 21:13:34,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 21:13:34,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 21:13:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:13:34,640 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 9 states. [2019-01-11 21:13:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:34,765 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-01-11 21:13:34,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:13:34,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-01-11 21:13:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:34,768 INFO L225 Difference]: With dead ends: 24 [2019-01-11 21:13:34,768 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 21:13:34,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:13:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 21:13:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-01-11 21:13:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 21:13:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-11 21:13:34,775 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2019-01-11 21:13:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:34,775 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-11 21:13:34,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 21:13:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-11 21:13:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:13:34,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:34,776 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2019-01-11 21:13:34,776 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash 764254063, now seen corresponding path program 4 times [2019-01-11 21:13:34,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:34,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:34,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:13:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:34,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:13:34,961 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 [2019-01-11 21:13:34,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 21:13:34,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 21:13:34,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:35,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:35,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:35,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-11 21:13:35,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 21:13:35,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 21:13:35,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-11 21:13:35,335 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 11 states. [2019-01-11 21:13:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:35,577 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-01-11 21:13:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 21:13:35,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-01-11 21:13:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:35,579 INFO L225 Difference]: With dead ends: 27 [2019-01-11 21:13:35,579 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 21:13:35,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-11 21:13:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 21:13:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-01-11 21:13:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 21:13:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-01-11 21:13:35,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2019-01-11 21:13:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:35,587 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-01-11 21:13:35,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 21:13:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-01-11 21:13:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 21:13:35,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:35,589 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1] [2019-01-11 21:13:35,589 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1810148957, now seen corresponding path program 5 times [2019-01-11 21:13:35,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:35,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:35,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:13:35,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:35,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:13:35,856 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 [2019-01-11 21:13:35,865 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-11 21:13:35,883 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-11 21:13:35,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:35,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:36,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:36,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-11 21:13:36,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 21:13:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 21:13:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-11 21:13:36,108 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 13 states. [2019-01-11 21:13:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:36,285 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-01-11 21:13:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 21:13:36,286 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-01-11 21:13:36,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:36,287 INFO L225 Difference]: With dead ends: 30 [2019-01-11 21:13:36,287 INFO L226 Difference]: Without dead ends: 26 [2019-01-11 21:13:36,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-11 21:13:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-11 21:13:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-11 21:13:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 21:13:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-01-11 21:13:36,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 20 [2019-01-11 21:13:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:36,294 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-01-11 21:13:36,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 21:13:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-01-11 21:13:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:13:36,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:36,295 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2019-01-11 21:13:36,295 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:36,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash 77203631, now seen corresponding path program 6 times [2019-01-11 21:13:36,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:36,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:36,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:13:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:36,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:13:36,618 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 [2019-01-11 21:13:36,627 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-11 21:13:36,658 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-11 21:13:36,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:36,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:37,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:37,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-11 21:13:37,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 21:13:37,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 21:13:37,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-11 21:13:37,144 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 15 states. [2019-01-11 21:13:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:37,337 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-01-11 21:13:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:13:37,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-01-11 21:13:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:37,343 INFO L225 Difference]: With dead ends: 33 [2019-01-11 21:13:37,343 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 21:13:37,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-11 21:13:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 21:13:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-01-11 21:13:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 21:13:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-01-11 21:13:37,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 23 [2019-01-11 21:13:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:37,350 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-11 21:13:37,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 21:13:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-01-11 21:13:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:13:37,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:37,351 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1] [2019-01-11 21:13:37,352 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash -590105315, now seen corresponding path program 7 times [2019-01-11 21:13:37,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:37,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:37,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:13:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:37,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:13:37,522 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 [2019-01-11 21:13:37,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:37,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:37,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:37,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-11 21:13:37,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 21:13:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 21:13:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-01-11 21:13:37,850 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 17 states. [2019-01-11 21:13:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:38,601 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-01-11 21:13:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 21:13:38,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-01-11 21:13:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:38,604 INFO L225 Difference]: With dead ends: 36 [2019-01-11 21:13:38,604 INFO L226 Difference]: Without dead ends: 32 [2019-01-11 21:13:38,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-01-11 21:13:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-11 21:13:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-11 21:13:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 21:13:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-01-11 21:13:38,612 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 26 [2019-01-11 21:13:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:38,612 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-11 21:13:38,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 21:13:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-01-11 21:13:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 21:13:38,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:38,614 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2019-01-11 21:13:38,614 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1012697583, now seen corresponding path program 8 times [2019-01-11 21:13:38,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:13:38,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:13:38,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:38,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:13:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:13:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:13:38,661 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:13:38,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:13:38 BoogieIcfgContainer [2019-01-11 21:13:38,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:13:38,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:13:38,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:13:38,684 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:13:38,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:13:32" (3/4) ... [2019-01-11 21:13:38,688 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-11 21:13:38,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:13:38,689 INFO L168 Benchmark]: Toolchain (without parser) took 6637.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -223.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:13:38,690 INFO L168 Benchmark]: CDTParser took 0.54 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. [2019-01-11 21:13:38,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.45 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:38,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.74 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:13:38,692 INFO L168 Benchmark]: Boogie Preprocessor took 17.61 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:38,693 INFO L168 Benchmark]: RCFGBuilder took 292.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:38,694 INFO L168 Benchmark]: TraceAbstraction took 5960.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:13:38,695 INFO L168 Benchmark]: Witness Printer took 4.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:38,699 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.54 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 319.45 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.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 37.74 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.61 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 292.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5960.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. 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 [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i [L27] c = c + ((unsigned char)1) [L21] COND FALSE !(c < (unsigned char)8) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. UNSAFE Result, 5.8s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 136 SDslu, 565 SDs, 0 SdLazy, 585 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 82 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.2s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 232 ConstructedInterpolants, 70 QuantifiedInterpolants, 53060 SizeOfPredicates, 7 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 82 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-0ed9222-m [2019-01-11 21:13:40,832 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:13:40,833 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:13:40,852 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:13:40,853 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:13:40,854 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:13:40,855 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:13:40,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:13:40,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:13:40,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:13:40,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:13:40,862 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:13:40,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:13:40,863 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:13:40,864 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:13:40,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:13:40,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:13:40,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:13:40,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:13:40,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:13:40,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:13:40,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:13:40,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:13:40,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:13:40,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:13:40,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:13:40,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:13:40,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:13:40,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:13:40,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:13:40,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:13:40,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:13:40,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:13:40,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:13:40,886 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:13:40,887 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:13:40,887 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-11 21:13:40,916 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:13:40,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:13:40,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:13:40,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:13:40,921 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:13:40,921 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:13:40,921 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:13:40,921 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:13:40,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:13:40,922 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:13:40,922 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:13:40,922 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:13:40,922 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-11 21:13:40,922 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-11 21:13:40,923 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:13:40,923 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:13:40,923 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:13:40,923 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:13:40,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:13:40,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:13:40,925 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:13:40,925 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:13:40,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:13:40,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:13:40,926 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:13:40,926 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:13:40,926 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-11 21:13:40,926 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:13:40,926 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-11 21:13:40,926 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-11 21:13:40,927 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 [2019-01-11 21:13:40,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:13:40,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:13:40,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:13:40,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:13:40,991 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:13:40,992 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2019-01-11 21:13:41,044 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e60e42fa2/81eb84e675f44449a2b29543098b45e1/FLAG4e288c7ff [2019-01-11 21:13:41,460 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:13:41,460 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2019-01-11 21:13:41,466 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e60e42fa2/81eb84e675f44449a2b29543098b45e1/FLAG4e288c7ff [2019-01-11 21:13:41,481 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e60e42fa2/81eb84e675f44449a2b29543098b45e1 [2019-01-11 21:13:41,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:13:41,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:13:41,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:13:41,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:13:41,490 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:13:41,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1271ba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41, skipping insertion in model container [2019-01-11 21:13:41,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:13:41,524 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:13:41,731 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:13:41,742 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:13:41,764 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:13:41,783 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:13:41,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41 WrapperNode [2019-01-11 21:13:41,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:13:41,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:13:41,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:13:41,785 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:13:41,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:13:41,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:13:41,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:13:41,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:13:41,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (1/1) ... [2019-01-11 21:13:41,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:13:41,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:13:41,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:13:41,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:13:41,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (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 [2019-01-11 21:13:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:13:42,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:13:42,241 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:13:42,242 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:13:42,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:13:42 BoogieIcfgContainer [2019-01-11 21:13:42,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:13:42,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:13:42,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:13:42,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:13:42,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:13:41" (1/3) ... [2019-01-11 21:13:42,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b52ffc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:13:42, skipping insertion in model container [2019-01-11 21:13:42,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:13:41" (2/3) ... [2019-01-11 21:13:42,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b52ffc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:13:42, skipping insertion in model container [2019-01-11 21:13:42,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:13:42" (3/3) ... [2019-01-11 21:13:42,267 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2019-01-11 21:13:42,280 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:13:42,288 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:13:42,307 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:13:42,353 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:13:42,354 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:13:42,354 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:13:42,354 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:13:42,355 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:13:42,355 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:13:42,355 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:13:42,356 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:13:42,356 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:13:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-11 21:13:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 21:13:42,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:42,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 21:13:42,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2019-01-11 21:13:42,387 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:42,388 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 [2019-01-11 21:13:42,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:42,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:42,453 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:13:42,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:13:42,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:13:42,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-11 21:13:42,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-11 21:13:42,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-11 21:13:42,473 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-11 21:13:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:42,488 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-01-11 21:13:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-11 21:13:42,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-01-11 21:13:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:42,499 INFO L225 Difference]: With dead ends: 21 [2019-01-11 21:13:42,499 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 21:13:42,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-11 21:13:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 21:13:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 21:13:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 21:13:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-11 21:13:42,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-11 21:13:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:42,537 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-11 21:13:42,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-11 21:13:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-11 21:13:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 21:13:42,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:42,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 21:13:42,538 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:42,538 INFO L82 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2019-01-11 21:13:42,539 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:42,539 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 [2019-01-11 21:13:42,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:42,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:42,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:13:42,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:13:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:13:42,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:13:42,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:13:42,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:13:42,605 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2019-01-11 21:13:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:42,646 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-01-11 21:13:42,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:13:42,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-11 21:13:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:42,647 INFO L225 Difference]: With dead ends: 16 [2019-01-11 21:13:42,648 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 21:13:42,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:13:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 21:13:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-01-11 21:13:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 21:13:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-01-11 21:13:42,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-01-11 21:13:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:42,652 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-11 21:13:42,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:13:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-01-11 21:13:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 21:13:42,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:42,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:13:42,653 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:42,654 INFO L82 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2019-01-11 21:13:42,654 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:42,654 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 [2019-01-11 21:13:42,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:42,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:42,761 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:13:42,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:13:42,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:13:42,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:13:42,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:13:42,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:13:42,764 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 4 states. [2019-01-11 21:13:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:42,830 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-11 21:13:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:13:42,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-11 21:13:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:42,832 INFO L225 Difference]: With dead ends: 24 [2019-01-11 21:13:42,833 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 21:13:42,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:13:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 21:13:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2019-01-11 21:13:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 21:13:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-11 21:13:42,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-01-11 21:13:42,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:42,840 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-11 21:13:42,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:13:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-11 21:13:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 21:13:42,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:42,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:13:42,841 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:42,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:42,841 INFO L82 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2019-01-11 21:13:42,842 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:42,842 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 [2019-01-11 21:13:42,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:42,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:42,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:13:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:43,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:43,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-11 21:13:43,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:13:43,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:13:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:13:43,030 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-11 21:13:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:43,279 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-01-11 21:13:43,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:13:43,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-01-11 21:13:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:43,281 INFO L225 Difference]: With dead ends: 23 [2019-01-11 21:13:43,282 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 21:13:43,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:13:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 21:13:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-11 21:13:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 21:13:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-11 21:13:43,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2019-01-11 21:13:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:43,290 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-11 21:13:43,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:13:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-01-11 21:13:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:13:43,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:43,292 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:13:43,293 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2019-01-11 21:13:43,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:43,295 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 [2019-01-11 21:13:43,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:13:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:13:43,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 21:13:43,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:13:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 21:13:43,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:43,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-11 21:13:43,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 21:13:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 21:13:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-11 21:13:43,743 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 10 states. [2019-01-11 21:13:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:44,784 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-01-11 21:13:44,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 21:13:44,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-11 21:13:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:44,787 INFO L225 Difference]: With dead ends: 56 [2019-01-11 21:13:44,787 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 21:13:44,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-01-11 21:13:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 21:13:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2019-01-11 21:13:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 21:13:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-01-11 21:13:44,799 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2019-01-11 21:13:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:44,799 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-11 21:13:44,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 21:13:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-11 21:13:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:13:44,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:44,800 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-11 21:13:44,801 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:44,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2019-01-11 21:13:44,802 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:44,802 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 [2019-01-11 21:13:44,818 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-11 21:13:44,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-11 21:13:44,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:44,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:44,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:13:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:45,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-11 21:13:45,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 21:13:45,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 21:13:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:13:45,007 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 12 states. [2019-01-11 21:13:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:45,184 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-01-11 21:13:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 21:13:45,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-01-11 21:13:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:45,187 INFO L225 Difference]: With dead ends: 35 [2019-01-11 21:13:45,187 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 21:13:45,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 21:13:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 21:13:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 21:13:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 21:13:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-01-11 21:13:45,195 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2019-01-11 21:13:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:45,195 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-01-11 21:13:45,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 21:13:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-01-11 21:13:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 21:13:45,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:45,197 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2019-01-11 21:13:45,198 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:45,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:45,198 INFO L82 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2019-01-11 21:13:45,199 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:45,199 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 [2019-01-11 21:13:45,215 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-11 21:13:45,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 21:13:45,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:45,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-11 21:13:46,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:13:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-11 21:13:47,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:47,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-01-11 21:13:47,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 21:13:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 21:13:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2019-01-11 21:13:47,660 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 32 states. [2019-01-11 21:13:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:51,366 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-01-11 21:13:51,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 21:13:51,366 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-01-11 21:13:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:51,368 INFO L225 Difference]: With dead ends: 75 [2019-01-11 21:13:51,368 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 21:13:51,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=379, Invalid=2171, Unknown=0, NotChecked=0, Total=2550 [2019-01-11 21:13:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 21:13:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2019-01-11 21:13:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 21:13:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-01-11 21:13:51,380 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2019-01-11 21:13:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:51,381 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-01-11 21:13:51,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 21:13:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-01-11 21:13:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 21:13:51,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:51,382 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2019-01-11 21:13:51,382 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2019-01-11 21:13:51,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:51,383 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 [2019-01-11 21:13:51,402 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 21:13:51,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 21:13:51,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:51,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:51,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:13:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:52,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:13:52,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-11 21:13:52,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-11 21:13:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-11 21:13:52,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-01-11 21:13:52,076 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 19 states. [2019-01-11 21:13:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:53,188 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2019-01-11 21:13:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 21:13:53,189 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-01-11 21:13:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:53,190 INFO L225 Difference]: With dead ends: 111 [2019-01-11 21:13:53,190 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 21:13:53,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 21:13:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 21:13:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2019-01-11 21:13:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 21:13:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-01-11 21:13:53,204 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 30 [2019-01-11 21:13:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:53,204 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-01-11 21:13:53,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-11 21:13:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-01-11 21:13:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-11 21:13:53,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:13:53,206 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1] [2019-01-11 21:13:53,206 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:13:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:13:53,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1430216517, now seen corresponding path program 5 times [2019-01-11 21:13:53,207 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:13:53,207 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 [2019-01-11 21:13:53,224 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2019-01-11 21:13:53,269 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-01-11 21:13:53,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:13:53,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:13:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:13:54,327 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:13:54,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:13:54,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-11 21:13:54,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 21:13:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 21:13:54,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2019-01-11 21:13:54,336 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 18 states. [2019-01-11 21:13:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:13:54,604 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-01-11 21:13:54,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 21:13:54,606 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-01-11 21:13:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:13:54,606 INFO L225 Difference]: With dead ends: 56 [2019-01-11 21:13:54,606 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:13:54,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2019-01-11 21:13:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:13:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:13:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:13:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:13:54,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-01-11 21:13:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:13:54,608 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:13:54,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 21:13:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:13:54,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:13:54,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:13:55,395 WARN L181 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 125 [2019-01-11 21:13:55,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:13:55,399 INFO L451 ceAbstractionStarter]: At program point L31(lines 12 32) the Hoare annotation is: true [2019-01-11 21:13:55,400 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 28) the Hoare annotation is: (let ((.cse0 (= (_ bv1 8) ULTIMATE.start_main_~y~0)) (.cse2 (= (_ bv37 8) ULTIMATE.start_main_~x~0)) (.cse1 (= ULTIMATE.start_main_~bit~0 (_ bv0 8))) (.cse5 ((_ zero_extend 24) ULTIMATE.start_main_~c~0)) (.cse3 (= (_ bv5 8) ULTIMATE.start_main_~y~0))) (or (and (= (_ bv2 8) ULTIMATE.start_main_~c~0) .cse0 .cse1 .cse2) (and .cse0 .cse2 (not (= (_ bv0 32) ((_ zero_extend 24) ULTIMATE.start_main_~bit~0))) (= (_ bv1 8) ULTIMATE.start_main_~c~0)) (and .cse2 (= (bvadd ULTIMATE.start_main_~bit~0 (_ bv252 8)) (_ bv0 8)) (= (_ bv3 8) ULTIMATE.start_main_~c~0) .cse3) (and (= (_ bv0 8) ULTIMATE.start_main_~c~0) .cse2 (= (_ bv0 8) ULTIMATE.start_main_~y~0)) (and (exists ((v_ULTIMATE.start_main_~c~0_31 (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_31))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))) (_ bv1 32))) ULTIMATE.start_main_~c~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse4))) (_ bv5 32))) ULTIMATE.start_main_~y~0)))) (bvslt .cse5 (_ bv8 32)) .cse2 .cse1 (exists ((v_ULTIMATE.start_main_~c~0_59 (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_59))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 (_ bv1 32)))))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv1 32)))))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 (_ bv1 32)))))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (_ bv1 32)))))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 (_ bv1 32)))))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))))) (and (bvslt .cse6 (_ bv8 32)) (bvslt .cse7 (_ bv8 32)) (bvslt .cse8 (_ bv8 32)) (bvslt .cse9 (_ bv8 32)) (bvslt .cse10 (_ bv8 32)) (bvslt .cse11 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse12 (_ bv1 32))) ULTIMATE.start_main_~c~0) (bvslt .cse12 (_ bv8 32)))))))))))) (and .cse2 .cse1 (= (_ bv5 8) ULTIMATE.start_main_~c~0) .cse3) (and .cse2 (exists ((v_ULTIMATE.start_main_~c~0_31 (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_31))) (and (= ((_ extract 7 0) (bvadd .cse13 (_ bv1 32))) ULTIMATE.start_main_~c~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse13))) (_ bv5 32))) ULTIMATE.start_main_~y~0)))) (= (_ bv6 8) ULTIMATE.start_main_~c~0)) (and .cse1 (and .cse2 (exists ((v_ULTIMATE.start_main_~c~0_31 (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_31))) (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 .cse14 (_ bv1 32))) ULTIMATE.start_main_~c~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15))) (_ bv5 32))) ULTIMATE.start_main_~y~0)))))) (exists ((v_ULTIMATE.start_main_~c~0_59 (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_59))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (_ bv1 32)))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 (_ bv1 32)))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (_ bv1 32)))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 (_ bv1 32)))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 (_ bv1 32)))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 (_ bv1 32)))))) (and (bvslt .cse16 (_ bv8 32)) (bvslt .cse17 (_ bv8 32)) (bvslt .cse18 (_ bv8 32)) (bvslt .cse19 (_ bv8 32)) (bvslt .cse20 (_ bv8 32)) (bvslt .cse21 (_ bv8 32)) (bvslt .cse22 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse22 (_ bv1 32))) ULTIMATE.start_main_~c~0) (bvslt .cse23 (_ bv8 32))))))))))))) (and .cse2 .cse1 (exists ((v_ULTIMATE.start_main_~c~0_59 (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_59))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 (_ bv1 32)))))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 (_ bv1 32)))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))))) (and (bvslt .cse24 (_ bv8 32)) (bvslt .cse25 (_ bv8 32)) (bvslt .cse26 (_ bv8 32)) (bvslt .cse27 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse25 (_ bv1 32))) ULTIMATE.start_main_~c~0))))))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ULTIMATE.start_main_~x~0) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))))))))))) .cse3))) [2019-01-11 21:13:55,401 INFO L448 ceAbstractionStarter]: For program point L21-3(lines 21 28) no Hoare annotation was computed. [2019-01-11 21:13:55,401 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-01-11 21:13:55,401 INFO L451 ceAbstractionStarter]: At program point L5-2(lines 4 9) the Hoare annotation is: true [2019-01-11 21:13:55,401 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-11 21:13:55,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:13:55,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:13:55,401 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-11 21:13:55,401 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2019-01-11 21:13:55,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-01-11 21:13:55,402 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-01-11 21:13:55,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:13:55 BoogieIcfgContainer [2019-01-11 21:13:55,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:13:55,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:13:55,473 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:13:55,474 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:13:55,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:13:42" (3/4) ... [2019-01-11 21:13:55,478 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:13:55,488 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:13:55,488 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:13:55,489 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-11 21:13:55,518 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2bv8 == c && 1bv8 == y) && bit == 0bv8) && 37bv8 == x) || (((1bv8 == y && 37bv8 == x) && !(0bv32 == ~zero_extendFrom8To32(bit))) && 1bv8 == c)) || (((37bv8 == x && ~bvadd64(bit, 252bv8) == 0bv8) && 3bv8 == c) && 5bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((((\exists v_ULTIMATE.start_main_~c~0_31 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31), 1bv32)[7:0]), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31))[7:0]), 5bv32)[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && 37bv8 == x) && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0_59 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 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(v_ULTIMATE.start_main_~c~0_59), 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(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 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(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || (((37bv8 == x && bit == 0bv8) && 5bv8 == c) && 5bv8 == y)) || ((37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_31 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31))[7:0]), 5bv32)[7:0] == y)) && 6bv8 == c)) || ((bit == 0bv8 && 37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_31 : bv8 :: (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31))[7:0]), 5bv32)[7:0] == y)) && (\exists v_ULTIMATE.start_main_~c~0_59 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 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(v_ULTIMATE.start_main_~c~0_59), 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(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 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_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 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_ULTIMATE.start_main_~c~0_59), 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(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || ((((37bv8 == x && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0_59 : bv8 :: (((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c)) && !(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0]))) && 5bv8 == y) [2019-01-11 21:13:55,535 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:13:55,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:13:55,536 INFO L168 Benchmark]: Toolchain (without parser) took 14051.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -230.1 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:55,537 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-11 21:13:55,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.01 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:55,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.17 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:13:55,539 INFO L168 Benchmark]: Boogie Preprocessor took 115.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:55,541 INFO L168 Benchmark]: RCFGBuilder took 304.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:55,541 INFO L168 Benchmark]: TraceAbstraction took 13226.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.1 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:13:55,542 INFO L168 Benchmark]: Witness Printer took 61.87 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-11 21:13:55,547 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.15 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 297.01 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 38.17 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 115.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 304.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13226.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.1 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * Witness Printer took 61.87 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,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: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant [2019-01-11 21:13:55,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_31,QUANTIFIED] [2019-01-11 21:13:55,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] [2019-01-11 21:13:55,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_59,QUANTIFIED] Derived loop invariant: ((((((((((2bv8 == c && 1bv8 == y) && bit == 0bv8) && 37bv8 == x) || (((1bv8 == y && 37bv8 == x) && !(0bv32 == ~zero_extendFrom8To32(bit))) && 1bv8 == c)) || (((37bv8 == x && ~bvadd64(bit, 252bv8) == 0bv8) && 3bv8 == c) && 5bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((((\exists v_ULTIMATE.start_main_~c~0_31 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31), 1bv32)[7:0]), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31))[7:0]), 5bv32)[7:0] == y) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && 37bv8 == x) && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0_59 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 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(v_ULTIMATE.start_main_~c~0_59), 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(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 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(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || (((37bv8 == x && bit == 0bv8) && 5bv8 == c) && 5bv8 == y)) || ((37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_31 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31))[7:0]), 5bv32)[7:0] == y)) && 6bv8 == c)) || ((bit == 0bv8 && 37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_31 : bv8 :: (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_31))[7:0]), 5bv32)[7:0] == y)) && (\exists v_ULTIMATE.start_main_~c~0_59 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 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(v_ULTIMATE.start_main_~c~0_59), 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(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 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_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 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_ULTIMATE.start_main_~c~0_59), 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(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || ((((37bv8 == x && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0_59 : bv8 :: (((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c)) && !(0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0]))) && 5bv8 == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. SAFE Result, 13.0s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 88 SDtfs, 379 SDslu, 328 SDs, 0 SdLazy, 821 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, 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, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 594 HoareAnnotationTreeSize, 3 FomulaSimplifications, 77 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 620 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 159 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 250 ConstructedInterpolants, 46 QuantifiedInterpolants, 128669 SizeOfPredicates, 26 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 194/576 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...