./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.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/byte_add_false-unreach-call_true-no-overflow_true-termination.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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/byte_add_false-unreach-call_true-no-overflow_true-termination.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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:02:10,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:02:10,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:02:10,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:02:10,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:02:10,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:02:10,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:02:10,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:02:10,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:02:10,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:02:10,612 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:02:10,613 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:02:10,613 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:02:10,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:02:10,616 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:02:10,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:02:10,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:02:10,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:02:10,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:02:10,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:02:10,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:02:10,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:02:10,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:02:10,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:02:10,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:02:10,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:02:10,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:02:10,634 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:02:10,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:02:10,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:02:10,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:02:10,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:02:10,637 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:02:10,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:02:10,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:02:10,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:02:10,641 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:02:10,672 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:02:10,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:02:10,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:02:10,673 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:02:10,674 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:02:10,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:02:10,675 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:02:10,675 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:02:10,675 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:02:10,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:02:10,677 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:02:10,677 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:02:10,677 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:02:10,677 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:02:10,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:02:10,678 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:02:10,678 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:02:10,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:02:10,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:02:10,678 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:02:10,678 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:02:10,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:02:10,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:02:10,682 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:02:10,682 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:02:10,682 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:02:10,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:02:10,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:02:10,683 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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2019-01-11 21:02:10,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:02:10,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:02:10,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:02:10,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:02:10,764 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:02:10,764 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-11 21:02:10,822 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54f1e290/e36a4eedb37c454aa55a5871006561c9/FLAG45c4d6627 [2019-01-11 21:02:11,224 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:02:11,225 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-11 21:02:11,232 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54f1e290/e36a4eedb37c454aa55a5871006561c9/FLAG45c4d6627 [2019-01-11 21:02:11,620 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54f1e290/e36a4eedb37c454aa55a5871006561c9 [2019-01-11 21:02:11,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:02:11,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:02:11,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:02:11,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:02:11,635 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:02:11,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:02:11" (1/1) ... [2019-01-11 21:02:11,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e13714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:11, skipping insertion in model container [2019-01-11 21:02:11,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:02:11" (1/1) ... [2019-01-11 21:02:11,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:02:11,676 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:02:11,976 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:02:11,981 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:02:12,052 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:02:12,070 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:02:12,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12 WrapperNode [2019-01-11 21:02:12,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:02:12,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:02:12,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:02:12,074 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:02:12,084 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:02:12" (1/1) ... [2019-01-11 21:02:12,098 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:02:12" (1/1) ... [2019-01-11 21:02:12,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:02:12,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:02:12,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:02:12,141 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:02:12,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (1/1) ... [2019-01-11 21:02:12,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (1/1) ... [2019-01-11 21:02:12,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (1/1) ... [2019-01-11 21:02:12,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (1/1) ... [2019-01-11 21:02:12,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (1/1) ... [2019-01-11 21:02:12,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (1/1) ... [2019-01-11 21:02:12,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (1/1) ... [2019-01-11 21:02:12,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:02:12,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:02:12,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:02:12,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:02:12,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (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:02:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:02:12,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:02:12,952 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:02:12,953 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-11 21:02:12,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:02:12 BoogieIcfgContainer [2019-01-11 21:02:12,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:02:12,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:02:12,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:02:12,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:02:12,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:02:11" (1/3) ... [2019-01-11 21:02:12,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111ff1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:02:12, skipping insertion in model container [2019-01-11 21:02:12,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:12" (2/3) ... [2019-01-11 21:02:12,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111ff1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:02:12, skipping insertion in model container [2019-01-11 21:02:12,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:02:12" (3/3) ... [2019-01-11 21:02:12,962 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-11 21:02:12,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:02:12,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:02:12,997 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:02:13,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:02:13,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:02:13,029 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:02:13,029 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:02:13,030 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:02:13,030 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:02:13,030 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:02:13,030 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:02:13,030 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:02:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-01-11 21:02:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 21:02:13,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:13,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:13,057 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:13,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1818568748, now seen corresponding path program 1 times [2019-01-11 21:02:13,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:13,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:13,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:13,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:13,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:13,189 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:02:13,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:02:13,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-11 21:02:13,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-11 21:02:13,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-11 21:02:13,213 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-01-11 21:02:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:13,230 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2019-01-11 21:02:13,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-11 21:02:13,232 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-11 21:02:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:13,243 INFO L225 Difference]: With dead ends: 56 [2019-01-11 21:02:13,243 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 21:02:13,247 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:02:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 21:02:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-11 21:02:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 21:02:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2019-01-11 21:02:13,284 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 11 [2019-01-11 21:02:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:13,284 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2019-01-11 21:02:13,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-11 21:02:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2019-01-11 21:02:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 21:02:13,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:13,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:13,286 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:13,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash -927982706, now seen corresponding path program 1 times [2019-01-11 21:02:13,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:13,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:13,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:13,473 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:02:13,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:13,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:02:13,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:02:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:02:13,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:02:13,476 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 3 states. [2019-01-11 21:02:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:13,955 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2019-01-11 21:02:13,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:02:13,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-11 21:02:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:13,959 INFO L225 Difference]: With dead ends: 88 [2019-01-11 21:02:13,959 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 21:02:13,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:02:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 21:02:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-01-11 21:02:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 21:02:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2019-01-11 21:02:13,972 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 11 [2019-01-11 21:02:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:13,972 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2019-01-11 21:02:13,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:02:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2019-01-11 21:02:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:02:13,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:13,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:13,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2028683165, now seen corresponding path program 1 times [2019-01-11 21:02:13,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:13,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:13,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:13,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:13,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:14,202 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-11 21:02:14,205 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:02:14,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:14,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:02:14,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:02:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:02:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:02:14,207 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. Second operand 4 states. [2019-01-11 21:02:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:15,024 INFO L93 Difference]: Finished difference Result 145 states and 248 transitions. [2019-01-11 21:02:15,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:02:15,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-11 21:02:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:15,030 INFO L225 Difference]: With dead ends: 145 [2019-01-11 21:02:15,030 INFO L226 Difference]: Without dead ends: 117 [2019-01-11 21:02:15,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-11 21:02:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2019-01-11 21:02:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 21:02:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2019-01-11 21:02:15,042 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 17 [2019-01-11 21:02:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:15,043 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2019-01-11 21:02:15,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:02:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2019-01-11 21:02:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:02:15,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:15,045 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:15,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash 738702772, now seen corresponding path program 1 times [2019-01-11 21:02:15,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:15,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:02:15,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:15,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:02:15,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:02:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:02:15,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:02:15,163 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand 4 states. [2019-01-11 21:02:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:15,587 INFO L93 Difference]: Finished difference Result 231 states and 364 transitions. [2019-01-11 21:02:15,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:02:15,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-11 21:02:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:15,589 INFO L225 Difference]: With dead ends: 231 [2019-01-11 21:02:15,590 INFO L226 Difference]: Without dead ends: 164 [2019-01-11 21:02:15,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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:02:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-11 21:02:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2019-01-11 21:02:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-11 21:02:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2019-01-11 21:02:15,610 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 178 transitions. Word has length 23 [2019-01-11 21:02:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:15,611 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 178 transitions. [2019-01-11 21:02:15,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:02:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 178 transitions. [2019-01-11 21:02:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 21:02:15,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:15,614 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:15,614 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1070476937, now seen corresponding path program 1 times [2019-01-11 21:02:15,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:15,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:15,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:15,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:15,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:02:15,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:15,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:02:15,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:02:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:02:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:15,884 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. Second operand 5 states. [2019-01-11 21:02:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:16,316 INFO L93 Difference]: Finished difference Result 338 states and 521 transitions. [2019-01-11 21:02:16,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:02:16,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-11 21:02:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:16,320 INFO L225 Difference]: With dead ends: 338 [2019-01-11 21:02:16,320 INFO L226 Difference]: Without dead ends: 236 [2019-01-11 21:02:16,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-11 21:02:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 121. [2019-01-11 21:02:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 21:02:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 188 transitions. [2019-01-11 21:02:16,336 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 188 transitions. Word has length 29 [2019-01-11 21:02:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:16,337 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 188 transitions. [2019-01-11 21:02:16,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:02:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 188 transitions. [2019-01-11 21:02:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 21:02:16,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:16,339 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:16,339 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:16,340 INFO L82 PathProgramCache]: Analyzing trace with hash -30175696, now seen corresponding path program 1 times [2019-01-11 21:02:16,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:16,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:02:16,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:16,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:02:16,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:02:16,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:02:16,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:16,450 INFO L87 Difference]: Start difference. First operand 121 states and 188 transitions. Second operand 5 states. [2019-01-11 21:02:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:17,506 INFO L93 Difference]: Finished difference Result 344 states and 527 transitions. [2019-01-11 21:02:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:02:17,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-11 21:02:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:17,508 INFO L225 Difference]: With dead ends: 344 [2019-01-11 21:02:17,509 INFO L226 Difference]: Without dead ends: 242 [2019-01-11 21:02:17,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-11 21:02:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 132. [2019-01-11 21:02:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 21:02:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 200 transitions. [2019-01-11 21:02:17,524 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 200 transitions. Word has length 30 [2019-01-11 21:02:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:17,524 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 200 transitions. [2019-01-11 21:02:17,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:02:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 200 transitions. [2019-01-11 21:02:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 21:02:17,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:17,526 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:17,527 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1454047176, now seen corresponding path program 1 times [2019-01-11 21:02:17,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:17,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:17,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:17,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:02:17,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:02:17,662 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:02:17,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:17,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-11 21:02:17,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:02:17,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-11 21:02:17,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:02:17,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:02:17,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:02:17,801 INFO L87 Difference]: Start difference. First operand 132 states and 200 transitions. Second operand 7 states. [2019-01-11 21:02:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:19,685 INFO L93 Difference]: Finished difference Result 322 states and 513 transitions. [2019-01-11 21:02:19,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:02:19,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-01-11 21:02:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:19,695 INFO L225 Difference]: With dead ends: 322 [2019-01-11 21:02:19,695 INFO L226 Difference]: Without dead ends: 218 [2019-01-11 21:02:19,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:02:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-11 21:02:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 174. [2019-01-11 21:02:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-11 21:02:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 234 transitions. [2019-01-11 21:02:19,707 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 234 transitions. Word has length 31 [2019-01-11 21:02:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:19,708 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 234 transitions. [2019-01-11 21:02:19,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:02:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 234 transitions. [2019-01-11 21:02:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 21:02:19,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:19,710 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:19,710 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash 153643337, now seen corresponding path program 1 times [2019-01-11 21:02:19,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:19,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:19,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:19,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:19,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-11 21:02:19,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:02:19,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:02:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:02:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:19,837 INFO L87 Difference]: Start difference. First operand 174 states and 234 transitions. Second operand 6 states. [2019-01-11 21:02:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:20,874 INFO L93 Difference]: Finished difference Result 631 states and 843 transitions. [2019-01-11 21:02:20,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:02:20,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-11 21:02:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:20,878 INFO L225 Difference]: With dead ends: 631 [2019-01-11 21:02:20,878 INFO L226 Difference]: Without dead ends: 486 [2019-01-11 21:02:20,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:02:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-01-11 21:02:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 174. [2019-01-11 21:02:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-11 21:02:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 234 transitions. [2019-01-11 21:02:20,892 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 234 transitions. Word has length 37 [2019-01-11 21:02:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:20,893 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 234 transitions. [2019-01-11 21:02:20,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:02:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 234 transitions. [2019-01-11 21:02:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-11 21:02:20,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:20,895 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:20,895 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1738720613, now seen corresponding path program 1 times [2019-01-11 21:02:20,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:20,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:20,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:20,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:20,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-11 21:02:20,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:20,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-11 21:02:20,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:02:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:02:21,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:21,000 INFO L87 Difference]: Start difference. First operand 174 states and 234 transitions. Second operand 6 states. [2019-01-11 21:02:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:22,014 INFO L93 Difference]: Finished difference Result 615 states and 823 transitions. [2019-01-11 21:02:22,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:02:22,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-11 21:02:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:22,018 INFO L225 Difference]: With dead ends: 615 [2019-01-11 21:02:22,019 INFO L226 Difference]: Without dead ends: 471 [2019-01-11 21:02:22,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:02:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-01-11 21:02:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 386. [2019-01-11 21:02:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-11 21:02:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 530 transitions. [2019-01-11 21:02:22,042 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 530 transitions. Word has length 38 [2019-01-11 21:02:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:22,042 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 530 transitions. [2019-01-11 21:02:22,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:02:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 530 transitions. [2019-01-11 21:02:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 21:02:22,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:22,045 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:22,046 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash 114978384, now seen corresponding path program 1 times [2019-01-11 21:02:22,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:22,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:22,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:22,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:22,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-11 21:02:22,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:22,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-11 21:02:22,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 21:02:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 21:02:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:02:22,524 INFO L87 Difference]: Start difference. First operand 386 states and 530 transitions. Second operand 8 states. [2019-01-11 21:02:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:25,353 INFO L93 Difference]: Finished difference Result 1995 states and 2776 transitions. [2019-01-11 21:02:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 21:02:25,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-01-11 21:02:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:25,361 INFO L225 Difference]: With dead ends: 1995 [2019-01-11 21:02:25,362 INFO L226 Difference]: Without dead ends: 1597 [2019-01-11 21:02:25,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:02:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2019-01-11 21:02:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1221. [2019-01-11 21:02:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-01-11 21:02:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1701 transitions. [2019-01-11 21:02:25,421 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1701 transitions. Word has length 39 [2019-01-11 21:02:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:25,421 INFO L480 AbstractCegarLoop]: Abstraction has 1221 states and 1701 transitions. [2019-01-11 21:02:25,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 21:02:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1701 transitions. [2019-01-11 21:02:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:02:25,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:25,426 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:25,426 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:25,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:25,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1859362712, now seen corresponding path program 1 times [2019-01-11 21:02:25,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:25,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:25,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:25,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:25,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:25,658 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-11 21:02:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 21:02:25,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:25,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:02:25,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:02:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:02:25,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:02:25,673 INFO L87 Difference]: Start difference. First operand 1221 states and 1701 transitions. Second operand 4 states. [2019-01-11 21:02:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:26,258 INFO L93 Difference]: Finished difference Result 1686 states and 2344 transitions. [2019-01-11 21:02:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:02:26,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-11 21:02:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:26,266 INFO L225 Difference]: With dead ends: 1686 [2019-01-11 21:02:26,268 INFO L226 Difference]: Without dead ends: 1241 [2019-01-11 21:02:26,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-01-11 21:02:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1233. [2019-01-11 21:02:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-01-11 21:02:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1682 transitions. [2019-01-11 21:02:26,331 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1682 transitions. Word has length 44 [2019-01-11 21:02:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:26,332 INFO L480 AbstractCegarLoop]: Abstraction has 1233 states and 1682 transitions. [2019-01-11 21:02:26,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:02:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1682 transitions. [2019-01-11 21:02:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-11 21:02:26,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:26,337 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:26,337 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1051976431, now seen corresponding path program 1 times [2019-01-11 21:02:26,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:26,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:26,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:26,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-11 21:02:26,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:02:26,827 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:02:26,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:26,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 21:02:27,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:02:27,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-01-11 21:02:27,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 21:02:27,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 21:02:27,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-01-11 21:02:27,186 INFO L87 Difference]: Start difference. First operand 1233 states and 1682 transitions. Second operand 15 states. [2019-01-11 21:02:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:29,853 INFO L93 Difference]: Finished difference Result 2994 states and 4060 transitions. [2019-01-11 21:02:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 21:02:29,854 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-01-11 21:02:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:29,862 INFO L225 Difference]: With dead ends: 2994 [2019-01-11 21:02:29,862 INFO L226 Difference]: Without dead ends: 1729 [2019-01-11 21:02:29,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2019-01-11 21:02:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2019-01-11 21:02:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1344. [2019-01-11 21:02:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2019-01-11 21:02:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1774 transitions. [2019-01-11 21:02:29,916 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1774 transitions. Word has length 45 [2019-01-11 21:02:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:29,916 INFO L480 AbstractCegarLoop]: Abstraction has 1344 states and 1774 transitions. [2019-01-11 21:02:29,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 21:02:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1774 transitions. [2019-01-11 21:02:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-11 21:02:29,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:29,919 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:29,920 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:29,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash -718889683, now seen corresponding path program 1 times [2019-01-11 21:02:29,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:29,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:29,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:29,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:29,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 21:02:30,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:30,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-11 21:02:30,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 21:02:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 21:02:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:02:30,097 INFO L87 Difference]: Start difference. First operand 1344 states and 1774 transitions. Second operand 9 states. [2019-01-11 21:02:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:31,704 INFO L93 Difference]: Finished difference Result 2938 states and 3905 transitions. [2019-01-11 21:02:31,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 21:02:31,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-01-11 21:02:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:31,714 INFO L225 Difference]: With dead ends: 2938 [2019-01-11 21:02:31,714 INFO L226 Difference]: Without dead ends: 1908 [2019-01-11 21:02:31,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-01-11 21:02:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-01-11 21:02:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1622. [2019-01-11 21:02:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2019-01-11 21:02:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2128 transitions. [2019-01-11 21:02:31,791 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2128 transitions. Word has length 46 [2019-01-11 21:02:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:31,791 INFO L480 AbstractCegarLoop]: Abstraction has 1622 states and 2128 transitions. [2019-01-11 21:02:31,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 21:02:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2128 transitions. [2019-01-11 21:02:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 21:02:31,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:31,796 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:31,797 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash 190973292, now seen corresponding path program 1 times [2019-01-11 21:02:31,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:31,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:31,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:31,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:31,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:32,125 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-11 21:02:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 21:02:32,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:32,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:02:32,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:02:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:02:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:02:32,138 INFO L87 Difference]: Start difference. First operand 1622 states and 2128 transitions. Second operand 4 states. [2019-01-11 21:02:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:32,583 INFO L93 Difference]: Finished difference Result 2161 states and 2836 transitions. [2019-01-11 21:02:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:02:32,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-01-11 21:02:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:32,590 INFO L225 Difference]: With dead ends: 2161 [2019-01-11 21:02:32,590 INFO L226 Difference]: Without dead ends: 1659 [2019-01-11 21:02:32,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-01-11 21:02:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1623. [2019-01-11 21:02:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-01-11 21:02:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2109 transitions. [2019-01-11 21:02:32,644 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2109 transitions. Word has length 48 [2019-01-11 21:02:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:32,644 INFO L480 AbstractCegarLoop]: Abstraction has 1623 states and 2109 transitions. [2019-01-11 21:02:32,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:02:32,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2109 transitions. [2019-01-11 21:02:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-11 21:02:32,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:32,648 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:32,648 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:32,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash -628542036, now seen corresponding path program 1 times [2019-01-11 21:02:32,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:32,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:32,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-11 21:02:32,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:02:32,891 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:02:32,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:32,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 21:02:33,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:02:33,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2019-01-11 21:02:33,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 21:02:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 21:02:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-01-11 21:02:33,097 INFO L87 Difference]: Start difference. First operand 1623 states and 2109 transitions. Second operand 16 states. [2019-01-11 21:02:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:37,938 INFO L93 Difference]: Finished difference Result 4069 states and 5330 transitions. [2019-01-11 21:02:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 21:02:37,939 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-01-11 21:02:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:37,947 INFO L225 Difference]: With dead ends: 4069 [2019-01-11 21:02:37,947 INFO L226 Difference]: Without dead ends: 2205 [2019-01-11 21:02:37,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=569, Invalid=4123, Unknown=0, NotChecked=0, Total=4692 [2019-01-11 21:02:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2019-01-11 21:02:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1742. [2019-01-11 21:02:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-01-11 21:02:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2247 transitions. [2019-01-11 21:02:38,013 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2247 transitions. Word has length 49 [2019-01-11 21:02:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:38,013 INFO L480 AbstractCegarLoop]: Abstraction has 1742 states and 2247 transitions. [2019-01-11 21:02:38,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 21:02:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2247 transitions. [2019-01-11 21:02:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 21:02:38,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:38,016 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:38,016 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:38,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash 126573537, now seen corresponding path program 1 times [2019-01-11 21:02:38,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:02:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:02:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:38,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:02:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:02:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:02:38,087 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:02:38,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:02:38 BoogieIcfgContainer [2019-01-11 21:02:38,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:02:38,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:02:38,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:02:38,144 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:02:38,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:02:12" (3/4) ... [2019-01-11 21:02:38,151 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-11 21:02:38,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:02:38,152 INFO L168 Benchmark]: Toolchain (without parser) took 26523.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -79.1 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:02:38,155 INFO L168 Benchmark]: CDTParser took 0.16 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:02:38,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.93 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:02:38,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.19 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 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:02:38,158 INFO L168 Benchmark]: Boogie Preprocessor took 138.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:02:38,162 INFO L168 Benchmark]: RCFGBuilder took 673.94 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:02:38,163 INFO L168 Benchmark]: TraceAbstraction took 25188.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.7 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:02:38,165 INFO L168 Benchmark]: Witness Printer took 7.18 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:02:38,170 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.16 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 442.93 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.19 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 673.94 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25188.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.7 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. * Witness Printer took 7.18 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 97. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 [L49] nb = (unsigned char)4 [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND TRUE i < (unsigned char)4 [L89] COND FALSE !(i == (unsigned char)0) [L90] COND TRUE i == (unsigned char)1 [L90] r1 = (unsigned char)0 [L91] COND FALSE !(i == (unsigned char)2) [L92] COND FALSE !(i == (unsigned char)3) [L94] i = i + (unsigned char)1 [L88] COND TRUE i < (unsigned char)4 [L89] COND FALSE !(i == (unsigned char)0) [L90] COND FALSE !(i == (unsigned char)1) [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 [L92] COND FALSE !(i == (unsigned char)3) [L94] i = i + (unsigned char)1 [L88] COND TRUE i < (unsigned char)4 [L89] COND FALSE !(i == (unsigned char)0) [L90] COND FALSE !(i == (unsigned char)1) [L91] COND FALSE !(i == (unsigned char)2) [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 [L94] i = i + (unsigned char)1 [L88] COND FALSE !(i < (unsigned char)4) [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; [L110] r = mp_add(a, b) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 1 error locations. UNSAFE Result, 25.1s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1237 SDtfs, 4329 SDslu, 3533 SDs, 0 SdLazy, 9231 SolverSat, 677 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred in iteration=15, 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.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2308 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 605 ConstructedInterpolants, 14 QuantifiedInterpolants, 114194 SizeOfPredicates, 7 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 361/367 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:02:40,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:02:40,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:02:40,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:02:40,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:02:40,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:02:40,574 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:02:40,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:02:40,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:02:40,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:02:40,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:02:40,580 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:02:40,581 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:02:40,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:02:40,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:02:40,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:02:40,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:02:40,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:02:40,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:02:40,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:02:40,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:02:40,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:02:40,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:02:40,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:02:40,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:02:40,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:02:40,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:02:40,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:02:40,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:02:40,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:02:40,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:02:40,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:02:40,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:02:40,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:02:40,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:02:40,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:02:40,608 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:02:40,625 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:02:40,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:02:40,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:02:40,627 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:02:40,628 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:02:40,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:02:40,628 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:02:40,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:02:40,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:02:40,628 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:02:40,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:02:40,630 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:02:40,630 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-11 21:02:40,630 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-11 21:02:40,630 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:02:40,631 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:02:40,631 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:02:40,631 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:02:40,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:02:40,632 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:02:40,632 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:02:40,632 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:02:40,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:02:40,632 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:02:40,633 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:02:40,633 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:02:40,633 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-11 21:02:40,633 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:02:40,633 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-11 21:02:40,633 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-11 21:02:40,635 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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2019-01-11 21:02:40,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:02:40,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:02:40,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:02:40,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:02:40,696 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:02:40,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-11 21:02:40,758 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef0ed0a14/4a926e7ef6f14d0980d6495e1e1bf92b/FLAG8270c5d12 [2019-01-11 21:02:41,248 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:02:41,249 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-11 21:02:41,258 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef0ed0a14/4a926e7ef6f14d0980d6495e1e1bf92b/FLAG8270c5d12 [2019-01-11 21:02:41,599 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef0ed0a14/4a926e7ef6f14d0980d6495e1e1bf92b [2019-01-11 21:02:41,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:02:41,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:02:41,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:02:41,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:02:41,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:02:41,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:41,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d03eccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41, skipping insertion in model container [2019-01-11 21:02:41,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:41,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:02:41,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:02:41,860 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:02:41,866 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:02:41,919 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:02:41,936 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:02:41,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41 WrapperNode [2019-01-11 21:02:41,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:02:41,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:02:41,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:02:41,939 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:02:41,949 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:02:41" (1/1) ... [2019-01-11 21:02:41,960 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:02:41" (1/1) ... [2019-01-11 21:02:42,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:02:42,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:02:42,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:02:42,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:02:42,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:42,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:42,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:42,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:42,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:42,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:42,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41" (1/1) ... [2019-01-11 21:02:42,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:02:42,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:02:42,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:02:42,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:02:42,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02: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:02:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:02:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:02:42,764 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:02:42,764 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-11 21:02:42,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:02:42 BoogieIcfgContainer [2019-01-11 21:02:42,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:02:42,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:02:42,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:02:42,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:02:42,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:02:41" (1/3) ... [2019-01-11 21:02:42,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdd138c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:02:42, skipping insertion in model container [2019-01-11 21:02:42,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:02:41" (2/3) ... [2019-01-11 21:02:42,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdd138c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:02:42, skipping insertion in model container [2019-01-11 21:02:42,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:02:42" (3/3) ... [2019-01-11 21:02:42,776 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2019-01-11 21:02:42,786 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:02:42,794 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:02:42,811 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:02:42,843 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:02:42,844 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:02:42,844 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:02:42,844 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:02:42,844 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:02:42,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:02:42,845 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:02:42,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:02:42,845 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:02:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-01-11 21:02:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 21:02:42,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:42,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:42,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2019-01-11 21:02:42,880 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:42,881 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:02:42,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:42,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:42,958 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:02:42,959 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:02:42,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:42,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:02:42,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-11 21:02:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-11 21:02:42,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-11 21:02:42,981 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2019-01-11 21:02:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:42,999 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2019-01-11 21:02:42,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-11 21:02:43,001 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-11 21:02:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:43,013 INFO L225 Difference]: With dead ends: 57 [2019-01-11 21:02:43,013 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 21:02:43,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:02:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 21:02:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-11 21:02:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 21:02:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2019-01-11 21:02:43,057 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2019-01-11 21:02:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:43,057 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2019-01-11 21:02:43,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-11 21:02:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2019-01-11 21:02:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 21:02:43,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:43,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:43,060 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:43,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2019-01-11 21:02:43,061 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:43,061 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:02:43,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:43,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:43,208 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:02:43,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:43,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:43,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:02:43,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:02:43,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:02:43,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:02:43,214 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand 4 states. [2019-01-11 21:02:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:43,879 INFO L93 Difference]: Finished difference Result 120 states and 208 transitions. [2019-01-11 21:02:43,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:02:43,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-11 21:02:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:43,882 INFO L225 Difference]: With dead ends: 120 [2019-01-11 21:02:43,882 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 21:02:43,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:02:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 21:02:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-01-11 21:02:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 21:02:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2019-01-11 21:02:43,901 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 12 [2019-01-11 21:02:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:43,901 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 137 transitions. [2019-01-11 21:02:43,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:02:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 137 transitions. [2019-01-11 21:02:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 21:02:43,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:43,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:43,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1343140563, now seen corresponding path program 1 times [2019-01-11 21:02:43,906 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:43,906 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:02:43,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:43,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:44,190 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:02:44,191 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:44,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:44,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:02:44,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:02:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:02:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:44,197 INFO L87 Difference]: Start difference. First operand 85 states and 137 transitions. Second operand 5 states. [2019-01-11 21:02:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:44,903 INFO L93 Difference]: Finished difference Result 172 states and 285 transitions. [2019-01-11 21:02:44,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:02:44,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-11 21:02:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:44,909 INFO L225 Difference]: With dead ends: 172 [2019-01-11 21:02:44,909 INFO L226 Difference]: Without dead ends: 144 [2019-01-11 21:02:44,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-11 21:02:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 85. [2019-01-11 21:02:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 21:02:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2019-01-11 21:02:44,930 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 13 [2019-01-11 21:02:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:44,930 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 137 transitions. [2019-01-11 21:02:44,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:02:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 137 transitions. [2019-01-11 21:02:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:02:44,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:44,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:44,932 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1251593412, now seen corresponding path program 1 times [2019-01-11 21:02:44,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:44,936 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:02:44,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:44,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:45,129 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:02:45,129 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:45,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:45,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-11 21:02:45,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:02:45,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:02:45,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:02:45,138 INFO L87 Difference]: Start difference. First operand 85 states and 137 transitions. Second operand 7 states. [2019-01-11 21:02:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:45,759 INFO L93 Difference]: Finished difference Result 220 states and 354 transitions. [2019-01-11 21:02:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 21:02:45,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-11 21:02:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:45,762 INFO L225 Difference]: With dead ends: 220 [2019-01-11 21:02:45,763 INFO L226 Difference]: Without dead ends: 192 [2019-01-11 21:02:45,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:02:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-11 21:02:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 119. [2019-01-11 21:02:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-11 21:02:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 188 transitions. [2019-01-11 21:02:45,782 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 188 transitions. Word has length 14 [2019-01-11 21:02:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:45,783 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 188 transitions. [2019-01-11 21:02:45,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:02:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 188 transitions. [2019-01-11 21:02:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:02:45,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:45,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:45,788 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1644620422, now seen corresponding path program 1 times [2019-01-11 21:02:45,789 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:45,789 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:02:45,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:45,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:45,923 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:02:45,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:45,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:45,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-11 21:02:45,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:02:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:02:45,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:45,930 INFO L87 Difference]: Start difference. First operand 119 states and 188 transitions. Second operand 6 states. [2019-01-11 21:02:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:46,267 INFO L93 Difference]: Finished difference Result 239 states and 375 transitions. [2019-01-11 21:02:46,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:02:46,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-11 21:02:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:46,271 INFO L225 Difference]: With dead ends: 239 [2019-01-11 21:02:46,271 INFO L226 Difference]: Without dead ends: 211 [2019-01-11 21:02:46,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-11 21:02:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 91. [2019-01-11 21:02:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 21:02:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2019-01-11 21:02:46,285 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 14 [2019-01-11 21:02:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:46,286 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2019-01-11 21:02:46,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:02:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2019-01-11 21:02:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:02:46,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:46,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:46,289 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1356809204, now seen corresponding path program 1 times [2019-01-11 21:02:46,290 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:46,291 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:02:46,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:46,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:46,377 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:02:46,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:46,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:46,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:02:46,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:02:46,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:02:46,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:02:46,382 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand 3 states. [2019-01-11 21:02:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:46,410 INFO L93 Difference]: Finished difference Result 125 states and 184 transitions. [2019-01-11 21:02:46,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:02:46,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-11 21:02:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:46,413 INFO L225 Difference]: With dead ends: 125 [2019-01-11 21:02:46,414 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 21:02:46,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:02:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 21:02:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-11 21:02:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 21:02:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2019-01-11 21:02:46,427 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 25 [2019-01-11 21:02:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:46,429 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2019-01-11 21:02:46,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:02:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2019-01-11 21:02:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:02:46,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:46,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:46,431 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:46,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:46,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1098643766, now seen corresponding path program 1 times [2019-01-11 21:02:46,432 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:46,432 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:02:46,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:46,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:46,527 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:02:46,527 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:46,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:46,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:02:46,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:02:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:02:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:02:46,531 INFO L87 Difference]: Start difference. First operand 111 states and 164 transitions. Second operand 4 states. [2019-01-11 21:02:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:46,849 INFO L93 Difference]: Finished difference Result 306 states and 447 transitions. [2019-01-11 21:02:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:02:46,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-01-11 21:02:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:46,853 INFO L225 Difference]: With dead ends: 306 [2019-01-11 21:02:46,853 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 21:02:46,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:02:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 21:02:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2019-01-11 21:02:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-11 21:02:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2019-01-11 21:02:46,871 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 25 [2019-01-11 21:02:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:46,871 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2019-01-11 21:02:46,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:02:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2019-01-11 21:02:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:02:46,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:46,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:46,875 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1130341095, now seen corresponding path program 1 times [2019-01-11 21:02:46,876 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:46,876 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:02:46,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:46,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:46,967 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:02:46,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:46,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:46,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:02:46,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:02:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:02:46,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:46,985 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand 5 states. [2019-01-11 21:02:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:47,182 INFO L93 Difference]: Finished difference Result 404 states and 587 transitions. [2019-01-11 21:02:47,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:02:47,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-11 21:02:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:47,186 INFO L225 Difference]: With dead ends: 404 [2019-01-11 21:02:47,186 INFO L226 Difference]: Without dead ends: 313 [2019-01-11 21:02:47,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:02:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-11 21:02:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 195. [2019-01-11 21:02:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-11 21:02:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2019-01-11 21:02:47,205 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 26 [2019-01-11 21:02:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:47,205 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2019-01-11 21:02:47,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:02:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2019-01-11 21:02:47,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:02:47,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:47,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:47,209 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2090446879, now seen corresponding path program 1 times [2019-01-11 21:02:47,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:47,210 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:02:47,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:47,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:47,334 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:02:47,335 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:47,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:47,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-11 21:02:47,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:02:47,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:02:47,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:47,343 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand 6 states. [2019-01-11 21:02:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:47,747 INFO L93 Difference]: Finished difference Result 502 states and 727 transitions. [2019-01-11 21:02:47,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:02:47,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-11 21:02:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:47,751 INFO L225 Difference]: With dead ends: 502 [2019-01-11 21:02:47,752 INFO L226 Difference]: Without dead ends: 411 [2019-01-11 21:02:47,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:47,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-01-11 21:02:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 195. [2019-01-11 21:02:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-11 21:02:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2019-01-11 21:02:47,770 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 27 [2019-01-11 21:02:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:47,773 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2019-01-11 21:02:47,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:02:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2019-01-11 21:02:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:02:47,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:47,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:47,782 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1781818591, now seen corresponding path program 1 times [2019-01-11 21:02:47,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:47,783 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:02:47,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:47,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:47,949 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:02:47,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:02:47,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:02:47,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-11 21:02:47,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:02:47,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:02:47,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:02:47,954 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand 7 states. [2019-01-11 21:02:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:48,256 INFO L93 Difference]: Finished difference Result 496 states and 713 transitions. [2019-01-11 21:02:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 21:02:48,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-11 21:02:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:48,261 INFO L225 Difference]: With dead ends: 496 [2019-01-11 21:02:48,261 INFO L226 Difference]: Without dead ends: 405 [2019-01-11 21:02:48,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:02:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-01-11 21:02:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 187. [2019-01-11 21:02:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 21:02:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 268 transitions. [2019-01-11 21:02:48,274 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 268 transitions. Word has length 27 [2019-01-11 21:02:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:48,275 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 268 transitions. [2019-01-11 21:02:48,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:02:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 268 transitions. [2019-01-11 21:02:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 21:02:48,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:48,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:48,276 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash 480147646, now seen corresponding path program 1 times [2019-01-11 21:02:48,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:48,279 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:02:48,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:48,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:48,420 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:02:48,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:02:48,463 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:02:48,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:02:48,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-11 21:02:48,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 21:02:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 21:02:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:02:48,465 INFO L87 Difference]: Start difference. First operand 187 states and 268 transitions. Second operand 8 states. [2019-01-11 21:02:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:50,261 INFO L93 Difference]: Finished difference Result 725 states and 1079 transitions. [2019-01-11 21:02:50,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 21:02:50,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-11 21:02:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:50,269 INFO L225 Difference]: With dead ends: 725 [2019-01-11 21:02:50,270 INFO L226 Difference]: Without dead ends: 634 [2019-01-11 21:02:50,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:02:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-01-11 21:02:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 460. [2019-01-11 21:02:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-01-11 21:02:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 671 transitions. [2019-01-11 21:02:50,321 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 671 transitions. Word has length 29 [2019-01-11 21:02:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:50,323 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 671 transitions. [2019-01-11 21:02:50,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 21:02:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 671 transitions. [2019-01-11 21:02:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 21:02:50,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:50,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:50,327 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1315471603, now seen corresponding path program 1 times [2019-01-11 21:02:50,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:50,332 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:02:50,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:50,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:50,771 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:02:50,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:02:50,852 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:02:50,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:02:50,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-11 21:02:50,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 21:02:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 21:02:50,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:02:50,860 INFO L87 Difference]: Start difference. First operand 460 states and 671 transitions. Second operand 8 states. [2019-01-11 21:02:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:52,881 INFO L93 Difference]: Finished difference Result 1546 states and 2333 transitions. [2019-01-11 21:02:52,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 21:02:52,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-11 21:02:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:52,889 INFO L225 Difference]: With dead ends: 1546 [2019-01-11 21:02:52,889 INFO L226 Difference]: Without dead ends: 1308 [2019-01-11 21:02:52,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:02:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-01-11 21:02:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1016. [2019-01-11 21:02:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-01-11 21:02:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1502 transitions. [2019-01-11 21:02:52,963 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1502 transitions. Word has length 31 [2019-01-11 21:02:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:52,963 INFO L480 AbstractCegarLoop]: Abstraction has 1016 states and 1502 transitions. [2019-01-11 21:02:52,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 21:02:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1502 transitions. [2019-01-11 21:02:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-11 21:02:52,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:52,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:52,967 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1914622646, now seen corresponding path program 1 times [2019-01-11 21:02:52,967 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:52,967 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:02:52,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:53,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:53,171 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:02:53,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:02:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (14)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:02:53,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:02:53,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-11 21:02:53,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 21:02:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 21:02:53,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-01-11 21:02:53,343 INFO L87 Difference]: Start difference. First operand 1016 states and 1502 transitions. Second operand 12 states. [2019-01-11 21:02:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:55,136 INFO L93 Difference]: Finished difference Result 1902 states and 2827 transitions. [2019-01-11 21:02:55,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 21:02:55,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-01-11 21:02:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:55,143 INFO L225 Difference]: With dead ends: 1902 [2019-01-11 21:02:55,144 INFO L226 Difference]: Without dead ends: 1479 [2019-01-11 21:02:55,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-01-11 21:02:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2019-01-11 21:02:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1186. [2019-01-11 21:02:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-01-11 21:02:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1731 transitions. [2019-01-11 21:02:55,215 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1731 transitions. Word has length 33 [2019-01-11 21:02:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:55,216 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 1731 transitions. [2019-01-11 21:02:55,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 21:02:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1731 transitions. [2019-01-11 21:02:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-11 21:02:55,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:55,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:55,219 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2055171256, now seen corresponding path program 1 times [2019-01-11 21:02:55,219 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:55,219 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:02:55,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:55,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:55,373 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:02:55,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:02:55,418 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:02:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:02:55,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-11 21:02:55,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:02:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:02:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:02:55,424 INFO L87 Difference]: Start difference. First operand 1186 states and 1731 transitions. Second operand 6 states. [2019-01-11 21:02:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:02:55,816 INFO L93 Difference]: Finished difference Result 2337 states and 3527 transitions. [2019-01-11 21:02:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:02:55,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-01-11 21:02:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:02:55,826 INFO L225 Difference]: With dead ends: 2337 [2019-01-11 21:02:55,826 INFO L226 Difference]: Without dead ends: 1868 [2019-01-11 21:02:55,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:02:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2019-01-11 21:02:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1484. [2019-01-11 21:02:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2019-01-11 21:02:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 2220 transitions. [2019-01-11 21:02:55,920 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 2220 transitions. Word has length 33 [2019-01-11 21:02:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:02:55,921 INFO L480 AbstractCegarLoop]: Abstraction has 1484 states and 2220 transitions. [2019-01-11 21:02:55,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:02:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2220 transitions. [2019-01-11 21:02:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 21:02:55,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:02:55,925 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:02:55,926 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:02:55,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:02:55,926 INFO L82 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2019-01-11 21:02:55,926 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:02:55,927 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:02:55,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:02:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:02:56,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:02:56,285 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-11 21:02:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 21:02:57,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:03:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 21:03:00,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:03:00,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-01-11 21:03:00,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 21:03:00,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 21:03:00,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 21:03:00,013 INFO L87 Difference]: Start difference. First operand 1484 states and 2220 transitions. Second operand 38 states. [2019-01-11 21:03:06,181 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-11 21:03:07,488 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-11 21:03:08,795 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-11 21:03:09,472 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-01-11 21:03:11,534 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-11 21:03:12,732 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-01-11 21:03:13,740 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-01-11 21:03:14,234 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-11 21:03:14,730 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-11 21:03:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:03:16,550 INFO L93 Difference]: Finished difference Result 2801 states and 4049 transitions. [2019-01-11 21:03:16,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 21:03:16,551 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 51 [2019-01-11 21:03:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:03:16,560 INFO L225 Difference]: With dead ends: 2801 [2019-01-11 21:03:16,560 INFO L226 Difference]: Without dead ends: 2689 [2019-01-11 21:03:16,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1663, Invalid=4817, Unknown=0, NotChecked=0, Total=6480 [2019-01-11 21:03:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2019-01-11 21:03:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 1633. [2019-01-11 21:03:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-01-11 21:03:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2426 transitions. [2019-01-11 21:03:16,681 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2426 transitions. Word has length 51 [2019-01-11 21:03:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:03:16,681 INFO L480 AbstractCegarLoop]: Abstraction has 1633 states and 2426 transitions. [2019-01-11 21:03:16,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 21:03:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2426 transitions. [2019-01-11 21:03:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 21:03:16,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:03:16,686 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:03:16,686 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:03:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:03:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash -65466659, now seen corresponding path program 1 times [2019-01-11 21:03:16,688 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:03:16,688 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:03:16,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:03:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:03:16,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:03:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:03:16,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:03:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:03:16,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:03:16,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2019-01-11 21:03:16,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 21:03:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 21:03:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:03:16,877 INFO L87 Difference]: Start difference. First operand 1633 states and 2426 transitions. Second operand 8 states. [2019-01-11 21:03:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:03:19,022 INFO L93 Difference]: Finished difference Result 3619 states and 5345 transitions. [2019-01-11 21:03:19,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 21:03:19,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-01-11 21:03:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:03:19,031 INFO L225 Difference]: With dead ends: 3619 [2019-01-11 21:03:19,031 INFO L226 Difference]: Without dead ends: 2048 [2019-01-11 21:03:19,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-11 21:03:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-01-11 21:03:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1693. [2019-01-11 21:03:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1693 states. [2019-01-11 21:03:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2407 transitions. [2019-01-11 21:03:19,156 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2407 transitions. Word has length 51 [2019-01-11 21:03:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:03:19,156 INFO L480 AbstractCegarLoop]: Abstraction has 1693 states and 2407 transitions. [2019-01-11 21:03:19,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 21:03:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2407 transitions. [2019-01-11 21:03:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 21:03:19,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:03:19,159 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:03:19,159 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:03:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:03:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1950719985, now seen corresponding path program 1 times [2019-01-11 21:03:19,159 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:03:19,160 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:03:19,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:03:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:03:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:03:19,371 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:03:19,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:03:19 BoogieIcfgContainer [2019-01-11 21:03:19,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:03:19,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:03:19,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:03:19,430 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:03:19,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:02:42" (3/4) ... [2019-01-11 21:03:19,436 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:03:19,637 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:03:19,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:03:19,638 INFO L168 Benchmark]: Toolchain (without parser) took 38033.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.4 MB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -408.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:03:19,640 INFO L168 Benchmark]: CDTParser took 0.21 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:03:19,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.37 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:03:19,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.62 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:03:19,643 INFO L168 Benchmark]: Boogie Preprocessor took 107.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:03:19,644 INFO L168 Benchmark]: RCFGBuilder took 649.50 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:03:19,645 INFO L168 Benchmark]: TraceAbstraction took 36661.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -258.1 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:03:19,646 INFO L168 Benchmark]: Witness Printer took 207.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:03:19,652 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.21 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 330.37 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.62 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 649.50 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36661.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -258.1 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Witness Printer took 207.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 [L49] nb = (unsigned char)4 [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND FALSE !(i < nb) [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND TRUE i < (unsigned char)4 [L89] COND FALSE !(i == (unsigned char)0) [L90] COND FALSE !(i == (unsigned char)1) [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 [L92] COND FALSE !(i == (unsigned char)3) [L94] i = i + (unsigned char)1 [L88] COND TRUE i < (unsigned char)4 [L89] COND FALSE !(i == (unsigned char)0) [L90] COND FALSE !(i == (unsigned char)1) [L91] COND FALSE !(i == (unsigned char)2) [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 [L94] i = i + (unsigned char)1 [L88] COND FALSE !(i < (unsigned char)4) [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; [L110] r = mp_add(a, b) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. UNSAFE Result, 36.5s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 28.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1904 SDtfs, 5344 SDslu, 8944 SDs, 0 SdLazy, 7202 SolverSat, 633 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 696 GetRequests, 529 SyntacticMatches, 3 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1693occurred in iteration=16, 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.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 3385 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 273435 SizeOfPredicates, 52 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 62/101 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...