./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 2e94e6aa 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-2e94e6a [2018-12-30 15:47:48,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:47:48,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:47:48,033 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:47:48,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:47:48,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:47:48,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:47:48,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:47:48,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:47:48,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:47:48,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:47:48,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:47:48,043 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:47:48,044 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:47:48,045 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:47:48,046 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:47:48,047 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:47:48,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:47:48,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:47:48,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:47:48,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:47:48,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:47:48,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:47:48,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:47:48,058 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:47:48,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:47:48,061 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:47:48,062 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:47:48,062 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:47:48,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:47:48,064 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:47:48,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:47:48,065 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:47:48,065 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:47:48,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:47:48,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:47:48,067 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 15:47:48,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:47:48,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:47:48,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:47:48,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:47:48,084 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:47:48,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:47:48,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:47:48,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 15:47:48,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:47:48,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:47:48,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:47:48,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:47:48,086 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:47:48,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:47:48,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:47:48,087 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:47:48,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:47:48,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:47:48,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:47:48,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:47:48,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:47:48,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:47:48,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:47:48,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:47:48,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:47:48,090 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 15:47:48,090 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:47:48,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 15:47:48,090 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 [2018-12-30 15:47:48,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:47:48,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:47:48,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:47:48,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:47:48,151 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:47:48,152 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 [2018-12-30 15:47:48,208 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5044a5df7/1f6d6edac3c04feaa5d2e3c6ff827b85/FLAG183f95acc [2018-12-30 15:47:48,666 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:47:48,667 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-30 15:47:48,675 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5044a5df7/1f6d6edac3c04feaa5d2e3c6ff827b85/FLAG183f95acc [2018-12-30 15:47:48,998 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5044a5df7/1f6d6edac3c04feaa5d2e3c6ff827b85 [2018-12-30 15:47:49,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:47:49,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:47:49,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:47:49,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:47:49,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:47:49,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100847a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49, skipping insertion in model container [2018-12-30 15:47:49,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:47:49,050 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:47:49,258 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:47:49,263 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:47:49,331 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:47:49,354 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:47:49,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49 WrapperNode [2018-12-30 15:47:49,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:47:49,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:47:49,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:47:49,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:47:49,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:47:49,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:47:49,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:47:49,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:47:49,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... [2018-12-30 15:47:49,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:47:49,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:47:49,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:47:49,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:47:49,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:47:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:47:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:47:50,235 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:47:50,236 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-30 15:47:50,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:47:50 BoogieIcfgContainer [2018-12-30 15:47:50,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:47:50,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:47:50,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:47:50,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:47:50,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:47:49" (1/3) ... [2018-12-30 15:47:50,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488fd1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:47:50, skipping insertion in model container [2018-12-30 15:47:50,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:47:49" (2/3) ... [2018-12-30 15:47:50,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488fd1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:47:50, skipping insertion in model container [2018-12-30 15:47:50,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:47:50" (3/3) ... [2018-12-30 15:47:50,247 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-30 15:47:50,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:47:50,264 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 15:47:50,282 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 15:47:50,319 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:47:50,320 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:47:50,320 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:47:50,321 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:47:50,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:47:50,321 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:47:50,321 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:47:50,321 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:47:50,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:47:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-12-30 15:47:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:47:50,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:50,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:47:50,347 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:50,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1818568748, now seen corresponding path program 1 times [2018-12-30 15:47:50,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:50,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:50,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:50,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:47:50,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:47:50,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:47:50,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-30 15:47:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-30 15:47:50,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 15:47:50,514 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-12-30 15:47:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:47:50,533 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2018-12-30 15:47:50,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-30 15:47:50,535 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-30 15:47:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:47:50,546 INFO L225 Difference]: With dead ends: 56 [2018-12-30 15:47:50,546 INFO L226 Difference]: Without dead ends: 37 [2018-12-30 15:47:50,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 15:47:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-30 15:47:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-30 15:47:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-30 15:47:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2018-12-30 15:47:50,592 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 11 [2018-12-30 15:47:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:47:50,593 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2018-12-30 15:47:50,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-30 15:47:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2018-12-30 15:47:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:47:50,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:50,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:47:50,595 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash -927982706, now seen corresponding path program 1 times [2018-12-30 15:47:50,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:50,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:50,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:50,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:50,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:47:50,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:47:50,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:47:50,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:47:50,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:47:50,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:47:50,732 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 3 states. [2018-12-30 15:47:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:47:51,231 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2018-12-30 15:47:51,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:47:51,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-30 15:47:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:47:51,235 INFO L225 Difference]: With dead ends: 88 [2018-12-30 15:47:51,235 INFO L226 Difference]: Without dead ends: 60 [2018-12-30 15:47:51,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:47:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-30 15:47:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-12-30 15:47:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-30 15:47:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2018-12-30 15:47:51,253 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 11 [2018-12-30 15:47:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:47:51,253 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-12-30 15:47:51,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:47:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2018-12-30 15:47:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 15:47:51,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:51,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:47:51,258 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2028683165, now seen corresponding path program 1 times [2018-12-30 15:47:51,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:51,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:51,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:51,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:51,519 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-30 15:47:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:47:51,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:47:51,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 15:47:51,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 15:47:51,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 15:47:51,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 15:47:51,523 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. Second operand 4 states. [2018-12-30 15:47:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:47:52,395 INFO L93 Difference]: Finished difference Result 145 states and 248 transitions. [2018-12-30 15:47:52,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:47:52,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-30 15:47:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:47:52,400 INFO L225 Difference]: With dead ends: 145 [2018-12-30 15:47:52,400 INFO L226 Difference]: Without dead ends: 117 [2018-12-30 15:47:52,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:47:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-30 15:47:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2018-12-30 15:47:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-30 15:47:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2018-12-30 15:47:52,415 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 17 [2018-12-30 15:47:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:47:52,415 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2018-12-30 15:47:52,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 15:47:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2018-12-30 15:47:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 15:47:52,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:52,419 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:47:52,420 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash 738702772, now seen corresponding path program 1 times [2018-12-30 15:47:52,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:52,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 15:47:52,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:47:52,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 15:47:52,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 15:47:52,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 15:47:52,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 15:47:52,564 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand 4 states. [2018-12-30 15:47:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:47:52,986 INFO L93 Difference]: Finished difference Result 231 states and 364 transitions. [2018-12-30 15:47:52,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:47:52,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-30 15:47:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:47:52,991 INFO L225 Difference]: With dead ends: 231 [2018-12-30 15:47:52,991 INFO L226 Difference]: Without dead ends: 164 [2018-12-30 15:47:52,992 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 [2018-12-30 15:47:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-30 15:47:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2018-12-30 15:47:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-30 15:47:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2018-12-30 15:47:53,009 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 178 transitions. Word has length 23 [2018-12-30 15:47:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:47:53,009 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 178 transitions. [2018-12-30 15:47:53,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 15:47:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 178 transitions. [2018-12-30 15:47:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 15:47:53,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:53,012 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] [2018-12-30 15:47:53,012 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:53,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1070476937, now seen corresponding path program 1 times [2018-12-30 15:47:53,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:53,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 15:47:53,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:47:53,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 15:47:53,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 15:47:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 15:47:53,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:47:53,255 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. Second operand 5 states. [2018-12-30 15:47:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:47:53,692 INFO L93 Difference]: Finished difference Result 338 states and 521 transitions. [2018-12-30 15:47:53,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 15:47:53,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-30 15:47:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:47:53,696 INFO L225 Difference]: With dead ends: 338 [2018-12-30 15:47:53,696 INFO L226 Difference]: Without dead ends: 236 [2018-12-30 15:47:53,697 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 [2018-12-30 15:47:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-30 15:47:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 121. [2018-12-30 15:47:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-30 15:47:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 188 transitions. [2018-12-30 15:47:53,712 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 188 transitions. Word has length 29 [2018-12-30 15:47:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:47:53,712 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 188 transitions. [2018-12-30 15:47:53,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 15:47:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 188 transitions. [2018-12-30 15:47:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 15:47:53,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:53,714 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] [2018-12-30 15:47:53,714 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:53,715 INFO L82 PathProgramCache]: Analyzing trace with hash -30175696, now seen corresponding path program 1 times [2018-12-30 15:47:53,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:53,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:53,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:53,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:53,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 15:47:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:47:53,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 15:47:53,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 15:47:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 15:47:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:47:53,849 INFO L87 Difference]: Start difference. First operand 121 states and 188 transitions. Second operand 5 states. [2018-12-30 15:47:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:47:54,956 INFO L93 Difference]: Finished difference Result 344 states and 527 transitions. [2018-12-30 15:47:54,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 15:47:54,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-30 15:47:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:47:54,959 INFO L225 Difference]: With dead ends: 344 [2018-12-30 15:47:54,959 INFO L226 Difference]: Without dead ends: 242 [2018-12-30 15:47:54,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:47:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-30 15:47:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 132. [2018-12-30 15:47:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-30 15:47:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 200 transitions. [2018-12-30 15:47:54,984 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 200 transitions. Word has length 30 [2018-12-30 15:47:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:47:54,984 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 200 transitions. [2018-12-30 15:47:54,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 15:47:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 200 transitions. [2018-12-30 15:47:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 15:47:54,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:54,987 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] [2018-12-30 15:47:54,990 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1454047176, now seen corresponding path program 1 times [2018-12-30 15:47:54,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:54,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 15:47:55,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:47:55,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:47:55,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:55,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:47:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-30 15:47:55,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:47:55,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-12-30 15:47:55,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 15:47:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 15:47:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:47:55,260 INFO L87 Difference]: Start difference. First operand 132 states and 200 transitions. Second operand 7 states. [2018-12-30 15:47:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:47:57,183 INFO L93 Difference]: Finished difference Result 322 states and 513 transitions. [2018-12-30 15:47:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 15:47:57,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-12-30 15:47:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:47:57,192 INFO L225 Difference]: With dead ends: 322 [2018-12-30 15:47:57,192 INFO L226 Difference]: Without dead ends: 218 [2018-12-30 15:47:57,193 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 [2018-12-30 15:47:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-30 15:47:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 174. [2018-12-30 15:47:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-30 15:47:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 234 transitions. [2018-12-30 15:47:57,205 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 234 transitions. Word has length 31 [2018-12-30 15:47:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:47:57,205 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 234 transitions. [2018-12-30 15:47:57,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 15:47:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 234 transitions. [2018-12-30 15:47:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 15:47:57,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:57,209 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] [2018-12-30 15:47:57,210 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash 153643337, now seen corresponding path program 1 times [2018-12-30 15:47:57,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:57,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:57,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:57,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:57,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-30 15:47:57,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:47:57,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 15:47:57,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:47:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:47:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:47:57,681 INFO L87 Difference]: Start difference. First operand 174 states and 234 transitions. Second operand 6 states. [2018-12-30 15:47:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:47:58,915 INFO L93 Difference]: Finished difference Result 631 states and 843 transitions. [2018-12-30 15:47:58,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:47:58,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-30 15:47:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:47:58,920 INFO L225 Difference]: With dead ends: 631 [2018-12-30 15:47:58,920 INFO L226 Difference]: Without dead ends: 486 [2018-12-30 15:47:58,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:47:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-12-30 15:47:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 174. [2018-12-30 15:47:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-30 15:47:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 234 transitions. [2018-12-30 15:47:58,934 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 234 transitions. Word has length 37 [2018-12-30 15:47:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:47:58,934 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 234 transitions. [2018-12-30 15:47:58,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:47:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 234 transitions. [2018-12-30 15:47:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-30 15:47:58,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:47:58,936 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] [2018-12-30 15:47:58,936 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:47:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:47:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1738720613, now seen corresponding path program 1 times [2018-12-30 15:47:58,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:47:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:47:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:58,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:47:58,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:47:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:47:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-30 15:47:59,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:47:59,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 15:47:59,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:47:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:47:59,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:47:59,049 INFO L87 Difference]: Start difference. First operand 174 states and 234 transitions. Second operand 6 states. [2018-12-30 15:48:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:00,057 INFO L93 Difference]: Finished difference Result 615 states and 823 transitions. [2018-12-30 15:48:00,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:48:00,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-12-30 15:48:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:00,063 INFO L225 Difference]: With dead ends: 615 [2018-12-30 15:48:00,063 INFO L226 Difference]: Without dead ends: 471 [2018-12-30 15:48:00,064 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 [2018-12-30 15:48:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-12-30 15:48:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 386. [2018-12-30 15:48:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-12-30 15:48:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 530 transitions. [2018-12-30 15:48:00,083 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 530 transitions. Word has length 38 [2018-12-30 15:48:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:00,084 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 530 transitions. [2018-12-30 15:48:00,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:48:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 530 transitions. [2018-12-30 15:48:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-30 15:48:00,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:00,086 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] [2018-12-30 15:48:00,086 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash 114978384, now seen corresponding path program 1 times [2018-12-30 15:48:00,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:00,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-30 15:48:00,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:00,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 15:48:00,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 15:48:00,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 15:48:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:48:00,584 INFO L87 Difference]: Start difference. First operand 386 states and 530 transitions. Second operand 8 states. [2018-12-30 15:48:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:03,687 INFO L93 Difference]: Finished difference Result 1995 states and 2776 transitions. [2018-12-30 15:48:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 15:48:03,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-12-30 15:48:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:03,696 INFO L225 Difference]: With dead ends: 1995 [2018-12-30 15:48:03,696 INFO L226 Difference]: Without dead ends: 1597 [2018-12-30 15:48:03,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:48:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2018-12-30 15:48:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1221. [2018-12-30 15:48:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2018-12-30 15:48:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1701 transitions. [2018-12-30 15:48:03,755 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1701 transitions. Word has length 39 [2018-12-30 15:48:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:03,756 INFO L480 AbstractCegarLoop]: Abstraction has 1221 states and 1701 transitions. [2018-12-30 15:48:03,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 15:48:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1701 transitions. [2018-12-30 15:48:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 15:48:03,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:03,762 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] [2018-12-30 15:48:03,762 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:03,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1859362712, now seen corresponding path program 1 times [2018-12-30 15:48:03,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:03,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:03,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:03,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 15:48:03,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:03,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:48:03,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 15:48:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 15:48:03,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 15:48:03,951 INFO L87 Difference]: Start difference. First operand 1221 states and 1701 transitions. Second operand 4 states. [2018-12-30 15:48:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:04,406 INFO L93 Difference]: Finished difference Result 1686 states and 2344 transitions. [2018-12-30 15:48:04,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:48:04,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-30 15:48:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:04,413 INFO L225 Difference]: With dead ends: 1686 [2018-12-30 15:48:04,414 INFO L226 Difference]: Without dead ends: 1241 [2018-12-30 15:48:04,415 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 [2018-12-30 15:48:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-12-30 15:48:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1233. [2018-12-30 15:48:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-12-30 15:48:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1682 transitions. [2018-12-30 15:48:04,470 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1682 transitions. Word has length 44 [2018-12-30 15:48:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:04,470 INFO L480 AbstractCegarLoop]: Abstraction has 1233 states and 1682 transitions. [2018-12-30 15:48:04,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 15:48:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1682 transitions. [2018-12-30 15:48:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-30 15:48:04,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:04,473 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] [2018-12-30 15:48:04,473 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:04,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1051976431, now seen corresponding path program 1 times [2018-12-30 15:48:04,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:04,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:04,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:04,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:04,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:05,018 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-12-30 15:48:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-30 15:48:05,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:48:05,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:48:05,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:05,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-30 15:48:05,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:48:05,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2018-12-30 15:48:05,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-30 15:48:05,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-30 15:48:05,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-30 15:48:05,487 INFO L87 Difference]: Start difference. First operand 1233 states and 1682 transitions. Second operand 15 states. [2018-12-30 15:48:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:08,201 INFO L93 Difference]: Finished difference Result 2994 states and 4060 transitions. [2018-12-30 15:48:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-30 15:48:08,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-12-30 15:48:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:08,209 INFO L225 Difference]: With dead ends: 2994 [2018-12-30 15:48:08,210 INFO L226 Difference]: Without dead ends: 1729 [2018-12-30 15:48:08,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2018-12-30 15:48:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-12-30 15:48:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1344. [2018-12-30 15:48:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2018-12-30 15:48:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1774 transitions. [2018-12-30 15:48:08,260 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1774 transitions. Word has length 45 [2018-12-30 15:48:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:08,260 INFO L480 AbstractCegarLoop]: Abstraction has 1344 states and 1774 transitions. [2018-12-30 15:48:08,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-30 15:48:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1774 transitions. [2018-12-30 15:48:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-30 15:48:08,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:08,262 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] [2018-12-30 15:48:08,264 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash -718889683, now seen corresponding path program 1 times [2018-12-30 15:48:08,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:08,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:08,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:08,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:08,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-30 15:48:08,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:08,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-30 15:48:08,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 15:48:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 15:48:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-30 15:48:08,410 INFO L87 Difference]: Start difference. First operand 1344 states and 1774 transitions. Second operand 9 states. [2018-12-30 15:48:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:10,025 INFO L93 Difference]: Finished difference Result 2938 states and 3905 transitions. [2018-12-30 15:48:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 15:48:10,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-12-30 15:48:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:10,044 INFO L225 Difference]: With dead ends: 2938 [2018-12-30 15:48:10,044 INFO L226 Difference]: Without dead ends: 1908 [2018-12-30 15:48:10,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-30 15:48:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2018-12-30 15:48:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1622. [2018-12-30 15:48:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-12-30 15:48:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2128 transitions. [2018-12-30 15:48:10,114 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2128 transitions. Word has length 46 [2018-12-30 15:48:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:10,115 INFO L480 AbstractCegarLoop]: Abstraction has 1622 states and 2128 transitions. [2018-12-30 15:48:10,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 15:48:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2128 transitions. [2018-12-30 15:48:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-30 15:48:10,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:10,119 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] [2018-12-30 15:48:10,119 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash 190973292, now seen corresponding path program 1 times [2018-12-30 15:48:10,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:10,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:10,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:10,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:10,317 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-30 15:48:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 15:48:10,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:10,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 15:48:10,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 15:48:10,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 15:48:10,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 15:48:10,363 INFO L87 Difference]: Start difference. First operand 1622 states and 2128 transitions. Second operand 4 states. [2018-12-30 15:48:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:10,799 INFO L93 Difference]: Finished difference Result 2161 states and 2836 transitions. [2018-12-30 15:48:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:48:10,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-30 15:48:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:10,806 INFO L225 Difference]: With dead ends: 2161 [2018-12-30 15:48:10,806 INFO L226 Difference]: Without dead ends: 1659 [2018-12-30 15:48:10,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:48:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-12-30 15:48:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1623. [2018-12-30 15:48:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2018-12-30 15:48:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2109 transitions. [2018-12-30 15:48:10,857 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2109 transitions. Word has length 48 [2018-12-30 15:48:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:10,857 INFO L480 AbstractCegarLoop]: Abstraction has 1623 states and 2109 transitions. [2018-12-30 15:48:10,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 15:48:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2109 transitions. [2018-12-30 15:48:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-30 15:48:10,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:10,861 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] [2018-12-30 15:48:10,861 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash -628542036, now seen corresponding path program 1 times [2018-12-30 15:48:10,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:10,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:10,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:10,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-30 15:48:11,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 15:48:11,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 15:48:11,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:11,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 15:48:11,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:48:11,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-12-30 15:48:11,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-30 15:48:11,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-30 15:48:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-12-30 15:48:11,240 INFO L87 Difference]: Start difference. First operand 1623 states and 2109 transitions. Second operand 16 states. [2018-12-30 15:48:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:16,012 INFO L93 Difference]: Finished difference Result 4069 states and 5330 transitions. [2018-12-30 15:48:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-30 15:48:16,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-30 15:48:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:16,020 INFO L225 Difference]: With dead ends: 4069 [2018-12-30 15:48:16,020 INFO L226 Difference]: Without dead ends: 2205 [2018-12-30 15:48:16,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=569, Invalid=4123, Unknown=0, NotChecked=0, Total=4692 [2018-12-30 15:48:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-12-30 15:48:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1742. [2018-12-30 15:48:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2018-12-30 15:48:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2247 transitions. [2018-12-30 15:48:16,080 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2247 transitions. Word has length 49 [2018-12-30 15:48:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:16,080 INFO L480 AbstractCegarLoop]: Abstraction has 1742 states and 2247 transitions. [2018-12-30 15:48:16,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-30 15:48:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2247 transitions. [2018-12-30 15:48:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 15:48:16,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:16,084 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] [2018-12-30 15:48:16,084 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash 126573537, now seen corresponding path program 1 times [2018-12-30 15:48:16,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:16,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:16,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 15:48:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 15:48:16,149 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 15:48:16,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 03:48:16 BoogieIcfgContainer [2018-12-30 15:48:16,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 15:48:16,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 15:48:16,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 15:48:16,203 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 15:48:16,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:47:50" (3/4) ... [2018-12-30 15:48:16,211 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-30 15:48:16,211 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 15:48:16,212 INFO L168 Benchmark]: Toolchain (without parser) took 27209.63 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:16,214 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. [2018-12-30 15:48:16,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:16,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.67 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:16,216 INFO L168 Benchmark]: Boogie Preprocessor took 119.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:16,218 INFO L168 Benchmark]: RCFGBuilder took 696.66 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.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:16,219 INFO L168 Benchmark]: TraceAbstraction took 25965.28 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 237.2 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:16,221 INFO L168 Benchmark]: Witness Printer took 8.25 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:48:16,228 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 349.94 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 63.67 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 696.66 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.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25965.28 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 237.2 MB. Max. memory is 11.5 GB. * Witness Printer took 8.25 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of 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.8s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1237 SDtfs, 4329 SDslu, 3533 SDs, 0 SdLazy, 9231 SolverSat, 677 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 16.2s 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.4s SatisfiabilityAnalysisTime, 3.6s 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-2e94e6a [2018-12-30 15:48:18,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:48:18,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:48:18,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:48:18,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:48:18,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:48:18,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:48:18,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:48:18,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:48:18,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:48:18,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:48:18,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:48:18,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:48:18,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:48:18,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:48:18,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:48:18,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:48:18,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:48:18,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:48:18,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:48:18,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:48:18,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:48:18,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:48:18,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:48:18,772 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:48:18,773 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:48:18,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:48:18,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:48:18,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:48:18,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:48:18,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:48:18,779 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:48:18,779 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:48:18,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:48:18,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:48:18,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:48:18,782 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-30 15:48:18,799 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:48:18,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:48:18,801 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:48:18,801 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:48:18,801 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:48:18,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:48:18,801 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:48:18,802 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:48:18,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:48:18,802 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:48:18,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:48:18,802 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:48:18,802 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-30 15:48:18,803 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-30 15:48:18,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:48:18,804 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:48:18,804 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:48:18,804 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:48:18,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:48:18,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:48:18,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:48:18,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:48:18,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:48:18,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:48:18,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:48:18,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:48:18,807 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-30 15:48:18,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:48:18,808 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-30 15:48:18,808 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-30 15:48:18,808 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 [2018-12-30 15:48:18,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:48:18,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:48:18,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:48:18,882 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:48:18,882 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:48:18,883 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 [2018-12-30 15:48:18,955 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55430dd33/f83829b1ab3b4f038cceb556eb497d26/FLAG7bd2cdebb [2018-12-30 15:48:19,468 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:48:19,469 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-30 15:48:19,480 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55430dd33/f83829b1ab3b4f038cceb556eb497d26/FLAG7bd2cdebb [2018-12-30 15:48:19,811 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55430dd33/f83829b1ab3b4f038cceb556eb497d26 [2018-12-30 15:48:19,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:48:19,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:48:19,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:48:19,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:48:19,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:48:19,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:48:19" (1/1) ... [2018-12-30 15:48:19,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3026fc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:19, skipping insertion in model container [2018-12-30 15:48:19,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:48:19" (1/1) ... [2018-12-30 15:48:19,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:48:19,870 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:48:20,105 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:48:20,118 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:48:20,212 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:48:20,236 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:48:20,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20 WrapperNode [2018-12-30 15:48:20,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:48:20,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:48:20,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:48:20,238 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:48:20,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:48:20,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:48:20,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:48:20,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:48:20,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... [2018-12-30 15:48:20,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:48:20,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:48:20,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:48:20,475 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:48:20,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:48:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:48:20,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:48:21,204 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:48:21,204 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-30 15:48:21,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:48:21 BoogieIcfgContainer [2018-12-30 15:48:21,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:48:21,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:48:21,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:48:21,209 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:48:21,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:48:19" (1/3) ... [2018-12-30 15:48:21,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f16907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:48:21, skipping insertion in model container [2018-12-30 15:48:21,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:20" (2/3) ... [2018-12-30 15:48:21,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f16907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:48:21, skipping insertion in model container [2018-12-30 15:48:21,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:48:21" (3/3) ... [2018-12-30 15:48:21,220 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-30 15:48:21,231 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:48:21,242 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 15:48:21,261 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 15:48:21,294 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:48:21,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:48:21,295 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:48:21,295 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:48:21,295 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:48:21,295 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:48:21,296 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:48:21,296 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:48:21,296 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:48:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-12-30 15:48:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:48:21,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:21,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:48:21,322 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1818568748, now seen corresponding path program 1 times [2018-12-30 15:48:21,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:21,332 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:21,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:21,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:21,411 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:48:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:21,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:48:21,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-30 15:48:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-30 15:48:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 15:48:21,444 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-12-30 15:48:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:21,479 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2018-12-30 15:48:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-30 15:48:21,481 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-30 15:48:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:21,500 INFO L225 Difference]: With dead ends: 56 [2018-12-30 15:48:21,500 INFO L226 Difference]: Without dead ends: 37 [2018-12-30 15:48:21,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-30 15:48:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-30 15:48:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-30 15:48:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-30 15:48:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2018-12-30 15:48:21,545 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 11 [2018-12-30 15:48:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:21,545 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2018-12-30 15:48:21,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-30 15:48:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2018-12-30 15:48:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:48:21,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:21,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:48:21,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash -927982706, now seen corresponding path program 1 times [2018-12-30 15:48:21,549 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:21,549 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:21,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:21,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:21,727 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-12-30 15:48:21,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:21,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:48:21,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 15:48:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 15:48:21,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 15:48:21,737 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 4 states. [2018-12-30 15:48:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:22,638 INFO L93 Difference]: Finished difference Result 119 states and 207 transitions. [2018-12-30 15:48:22,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 15:48:22,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-30 15:48:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:22,642 INFO L225 Difference]: With dead ends: 119 [2018-12-30 15:48:22,642 INFO L226 Difference]: Without dead ends: 91 [2018-12-30 15:48:22,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 15:48:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-30 15:48:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2018-12-30 15:48:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-30 15:48:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 136 transitions. [2018-12-30 15:48:22,669 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 136 transitions. Word has length 11 [2018-12-30 15:48:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:22,673 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 136 transitions. [2018-12-30 15:48:22,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 15:48:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 136 transitions. [2018-12-30 15:48:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-30 15:48:22,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:22,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:48:22,675 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1727731979, now seen corresponding path program 1 times [2018-12-30 15:48:22,677 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:22,679 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:22,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:22,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:22,798 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:48:22,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:22,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 15:48:22,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 15:48:22,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 15:48:22,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:48:22,806 INFO L87 Difference]: Start difference. First operand 84 states and 136 transitions. Second operand 5 states. [2018-12-30 15:48:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:23,651 INFO L93 Difference]: Finished difference Result 171 states and 284 transitions. [2018-12-30 15:48:23,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:48:23,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-30 15:48:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:23,656 INFO L225 Difference]: With dead ends: 171 [2018-12-30 15:48:23,656 INFO L226 Difference]: Without dead ends: 143 [2018-12-30 15:48:23,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:48:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-30 15:48:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2018-12-30 15:48:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-30 15:48:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 136 transitions. [2018-12-30 15:48:23,670 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 136 transitions. Word has length 12 [2018-12-30 15:48:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:23,670 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 136 transitions. [2018-12-30 15:48:23,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 15:48:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 136 transitions. [2018-12-30 15:48:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 15:48:23,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:23,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:48:23,673 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1959361703, now seen corresponding path program 1 times [2018-12-30 15:48:23,675 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:23,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:23,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:48:23,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:23,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 15:48:23,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 15:48:23,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 15:48:23,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:48:23,810 INFO L87 Difference]: Start difference. First operand 84 states and 136 transitions. Second operand 7 states. [2018-12-30 15:48:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:24,977 INFO L93 Difference]: Finished difference Result 219 states and 353 transitions. [2018-12-30 15:48:24,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 15:48:24,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-30 15:48:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:24,983 INFO L225 Difference]: With dead ends: 219 [2018-12-30 15:48:24,983 INFO L226 Difference]: Without dead ends: 191 [2018-12-30 15:48:24,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:48:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-30 15:48:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 118. [2018-12-30 15:48:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-30 15:48:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2018-12-30 15:48:25,012 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 13 [2018-12-30 15:48:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:25,012 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2018-12-30 15:48:25,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 15:48:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2018-12-30 15:48:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 15:48:25,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:25,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:48:25,015 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1942578583, now seen corresponding path program 1 times [2018-12-30 15:48:25,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:25,017 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:25,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:25,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:25,115 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:48:25,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:25,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 15:48:25,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:48:25,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:48:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:48:25,119 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand 6 states. [2018-12-30 15:48:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:25,529 INFO L93 Difference]: Finished difference Result 238 states and 374 transitions. [2018-12-30 15:48:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:48:25,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-30 15:48:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:25,532 INFO L225 Difference]: With dead ends: 238 [2018-12-30 15:48:25,532 INFO L226 Difference]: Without dead ends: 210 [2018-12-30 15:48:25,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:48:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-30 15:48:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 90. [2018-12-30 15:48:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-30 15:48:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 135 transitions. [2018-12-30 15:48:25,558 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 135 transitions. Word has length 13 [2018-12-30 15:48:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:25,558 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 135 transitions. [2018-12-30 15:48:25,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:48:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 135 transitions. [2018-12-30 15:48:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 15:48:25,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:25,560 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] [2018-12-30 15:48:25,560 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash -846983380, now seen corresponding path program 1 times [2018-12-30 15:48:25,561 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:25,561 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:25,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:25,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:25,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-12-30 15:48:25,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:25,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 15:48:25,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 15:48:25,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 15:48:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 15:48:25,647 INFO L87 Difference]: Start difference. First operand 90 states and 135 transitions. Second operand 4 states. [2018-12-30 15:48:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:25,881 INFO L93 Difference]: Finished difference Result 243 states and 360 transitions. [2018-12-30 15:48:25,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 15:48:25,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-30 15:48:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:25,883 INFO L225 Difference]: With dead ends: 243 [2018-12-30 15:48:25,883 INFO L226 Difference]: Without dead ends: 172 [2018-12-30 15:48:25,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 15:48:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-30 15:48:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2018-12-30 15:48:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-30 15:48:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2018-12-30 15:48:25,899 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 24 [2018-12-30 15:48:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:25,899 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2018-12-30 15:48:25,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 15:48:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2018-12-30 15:48:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 15:48:25,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:25,902 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] [2018-12-30 15:48:25,903 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:25,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1918803722, now seen corresponding path program 1 times [2018-12-30 15:48:25,903 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:25,903 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:25,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:25,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:26,090 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:48:26,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:26,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 15:48:26,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 15:48:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 15:48:26,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:48:26,100 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand 5 states. [2018-12-30 15:48:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:26,438 INFO L93 Difference]: Finished difference Result 321 states and 472 transitions. [2018-12-30 15:48:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:48:26,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-30 15:48:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:26,441 INFO L225 Difference]: With dead ends: 321 [2018-12-30 15:48:26,442 INFO L226 Difference]: Without dead ends: 250 [2018-12-30 15:48:26,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:48:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-30 15:48:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 154. [2018-12-30 15:48:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-30 15:48:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2018-12-30 15:48:26,456 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 25 [2018-12-30 15:48:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:26,456 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2018-12-30 15:48:26,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 15:48:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2018-12-30 15:48:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 15:48:26,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:26,459 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] [2018-12-30 15:48:26,460 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1185686367, now seen corresponding path program 1 times [2018-12-30 15:48:26,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:26,461 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:26,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:26,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:26,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:48:26,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:26,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 15:48:26,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 15:48:26,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 15:48:26,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:48:26,626 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand 7 states. [2018-12-30 15:48:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:27,800 INFO L93 Difference]: Finished difference Result 393 states and 572 transitions. [2018-12-30 15:48:27,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 15:48:27,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-30 15:48:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:27,803 INFO L225 Difference]: With dead ends: 393 [2018-12-30 15:48:27,803 INFO L226 Difference]: Without dead ends: 322 [2018-12-30 15:48:27,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:48:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-30 15:48:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 210. [2018-12-30 15:48:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-30 15:48:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 307 transitions. [2018-12-30 15:48:27,818 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 307 transitions. Word has length 26 [2018-12-30 15:48:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:27,819 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 307 transitions. [2018-12-30 15:48:27,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 15:48:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2018-12-30 15:48:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 15:48:27,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:27,822 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] [2018-12-30 15:48:27,822 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash -762984541, now seen corresponding path program 1 times [2018-12-30 15:48:27,823 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:27,823 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 15:48:27,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:27,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:27,923 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:48:27,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:27,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 15:48:27,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:48:27,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:48:27,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:48:27,926 INFO L87 Difference]: Start difference. First operand 210 states and 307 transitions. Second operand 6 states. [2018-12-30 15:48:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:28,192 INFO L93 Difference]: Finished difference Result 391 states and 566 transitions. [2018-12-30 15:48:28,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:48:28,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-30 15:48:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:28,197 INFO L225 Difference]: With dead ends: 391 [2018-12-30 15:48:28,197 INFO L226 Difference]: Without dead ends: 320 [2018-12-30 15:48:28,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:48:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-30 15:48:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 146. [2018-12-30 15:48:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-30 15:48:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2018-12-30 15:48:28,211 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 26 [2018-12-30 15:48:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:28,212 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2018-12-30 15:48:28,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:48:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2018-12-30 15:48:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 15:48:28,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:28,213 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] [2018-12-30 15:48:28,214 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:28,215 INFO L82 PathProgramCache]: Analyzing trace with hash 566167520, now seen corresponding path program 1 times [2018-12-30 15:48:28,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:28,216 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 [2018-12-30 15:48:28,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:28,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:28,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:48:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:28,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:48:28,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-30 15:48:28,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 15:48:28,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 15:48:28,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:48:28,382 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand 8 states. [2018-12-30 15:48:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:29,572 INFO L93 Difference]: Finished difference Result 552 states and 834 transitions. [2018-12-30 15:48:29,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 15:48:29,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-30 15:48:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:29,579 INFO L225 Difference]: With dead ends: 552 [2018-12-30 15:48:29,579 INFO L226 Difference]: Without dead ends: 481 [2018-12-30 15:48:29,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:48:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-12-30 15:48:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 387. [2018-12-30 15:48:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-30 15:48:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 558 transitions. [2018-12-30 15:48:29,602 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 558 transitions. Word has length 28 [2018-12-30 15:48:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:29,602 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 558 transitions. [2018-12-30 15:48:29,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 15:48:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 558 transitions. [2018-12-30 15:48:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 15:48:29,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:29,603 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] [2018-12-30 15:48:29,605 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1918775435, now seen corresponding path program 1 times [2018-12-30 15:48:29,605 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:29,606 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 [2018-12-30 15:48:29,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:29,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:29,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:48:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:29,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:48:29,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-30 15:48:29,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 15:48:29,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 15:48:29,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:48:29,762 INFO L87 Difference]: Start difference. First operand 387 states and 558 transitions. Second operand 8 states. [2018-12-30 15:48:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:32,483 INFO L93 Difference]: Finished difference Result 1259 states and 1886 transitions. [2018-12-30 15:48:32,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 15:48:32,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-30 15:48:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:32,489 INFO L225 Difference]: With dead ends: 1259 [2018-12-30 15:48:32,489 INFO L226 Difference]: Without dead ends: 1057 [2018-12-30 15:48:32,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:48:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-12-30 15:48:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 875. [2018-12-30 15:48:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-12-30 15:48:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1269 transitions. [2018-12-30 15:48:32,548 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1269 transitions. Word has length 30 [2018-12-30 15:48:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:32,548 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1269 transitions. [2018-12-30 15:48:32,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 15:48:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1269 transitions. [2018-12-30 15:48:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 15:48:32,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:32,551 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] [2018-12-30 15:48:32,552 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash -610252502, now seen corresponding path program 1 times [2018-12-30 15:48:32,552 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:32,552 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 [2018-12-30 15:48:32,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:32,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:32,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:48:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:48:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-30 15:48:32,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:48:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:48:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:48:32,858 INFO L87 Difference]: Start difference. First operand 875 states and 1269 transitions. Second operand 6 states. [2018-12-30 15:48:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:33,819 INFO L93 Difference]: Finished difference Result 1623 states and 2515 transitions. [2018-12-30 15:48:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:48:33,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-12-30 15:48:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:33,827 INFO L225 Difference]: With dead ends: 1623 [2018-12-30 15:48:33,827 INFO L226 Difference]: Without dead ends: 1349 [2018-12-30 15:48:33,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:48:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-12-30 15:48:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1170. [2018-12-30 15:48:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2018-12-30 15:48:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1760 transitions. [2018-12-30 15:48:33,894 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1760 transitions. Word has length 32 [2018-12-30 15:48:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:33,895 INFO L480 AbstractCegarLoop]: Abstraction has 1170 states and 1760 transitions. [2018-12-30 15:48:33,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:48:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1760 transitions. [2018-12-30 15:48:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 15:48:33,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:33,899 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] [2018-12-30 15:48:33,899 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash 126573537, now seen corresponding path program 1 times [2018-12-30 15:48:33,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:33,900 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 [2018-12-30 15:48:33,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:34,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:35,341 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-30 15:48:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-30 15:48:35,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:48:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-30 15:48:37,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:48:37,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-12-30 15:48:37,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-30 15:48:37,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-30 15:48:37,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2018-12-30 15:48:37,997 INFO L87 Difference]: Start difference. First operand 1170 states and 1760 transitions. Second operand 38 states. [2018-12-30 15:48:38,676 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-30 15:48:43,956 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-30 15:48:45,324 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-12-30 15:48:46,091 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-12-30 15:48:47,765 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-12-30 15:48:48,606 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-12-30 15:48:49,551 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2018-12-30 15:48:50,059 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-12-30 15:48:50,386 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-12-30 15:48:52,701 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-12-30 15:48:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:52,889 INFO L93 Difference]: Finished difference Result 2802 states and 4085 transitions. [2018-12-30 15:48:52,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-30 15:48:52,890 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2018-12-30 15:48:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:52,901 INFO L225 Difference]: With dead ends: 2802 [2018-12-30 15:48:52,901 INFO L226 Difference]: Without dead ends: 2718 [2018-12-30 15:48:52,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1663, Invalid=4817, Unknown=0, NotChecked=0, Total=6480 [2018-12-30 15:48:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2018-12-30 15:48:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 1347. [2018-12-30 15:48:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-12-30 15:48:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2009 transitions. [2018-12-30 15:48:53,002 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2009 transitions. Word has length 50 [2018-12-30 15:48:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:53,002 INFO L480 AbstractCegarLoop]: Abstraction has 1347 states and 2009 transitions. [2018-12-30 15:48:53,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-30 15:48:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2009 transitions. [2018-12-30 15:48:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 15:48:53,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:53,006 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] [2018-12-30 15:48:53,007 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:53,007 INFO L82 PathProgramCache]: Analyzing trace with hash -884543713, now seen corresponding path program 1 times [2018-12-30 15:48:53,007 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:53,008 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 [2018-12-30 15:48:53,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:53,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 15:48:53,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:48:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 15:48:53,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:48:53,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2018-12-30 15:48:53,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 15:48:53,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 15:48:53,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:48:53,166 INFO L87 Difference]: Start difference. First operand 1347 states and 2009 transitions. Second operand 8 states. [2018-12-30 15:48:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:54,780 INFO L93 Difference]: Finished difference Result 2915 states and 4336 transitions. [2018-12-30 15:48:54,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-30 15:48:54,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-12-30 15:48:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:54,789 INFO L225 Difference]: With dead ends: 2915 [2018-12-30 15:48:54,789 INFO L226 Difference]: Without dead ends: 1637 [2018-12-30 15:48:54,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-30 15:48:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-12-30 15:48:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1409. [2018-12-30 15:48:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1409 states. [2018-12-30 15:48:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2007 transitions. [2018-12-30 15:48:54,886 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 2007 transitions. Word has length 50 [2018-12-30 15:48:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:54,887 INFO L480 AbstractCegarLoop]: Abstraction has 1409 states and 2007 transitions. [2018-12-30 15:48:54,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 15:48:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2007 transitions. [2018-12-30 15:48:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 15:48:54,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:54,890 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] [2018-12-30 15:48:54,890 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash 103941283, now seen corresponding path program 1 times [2018-12-30 15:48:54,892 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:54,892 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 [2018-12-30 15:48:54,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:54,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-30 15:48:55,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 15:48:55,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:55,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:48:55,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:48:55,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:48:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:48:55,035 INFO L87 Difference]: Start difference. First operand 1409 states and 2007 transitions. Second operand 3 states. [2018-12-30 15:48:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:55,225 INFO L93 Difference]: Finished difference Result 1911 states and 2710 transitions. [2018-12-30 15:48:55,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:48:55,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-30 15:48:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:55,236 INFO L225 Difference]: With dead ends: 1911 [2018-12-30 15:48:55,236 INFO L226 Difference]: Without dead ends: 1883 [2018-12-30 15:48:55,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:48:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-12-30 15:48:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1664. [2018-12-30 15:48:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2018-12-30 15:48:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2399 transitions. [2018-12-30 15:48:55,353 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2399 transitions. Word has length 50 [2018-12-30 15:48:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:55,356 INFO L480 AbstractCegarLoop]: Abstraction has 1664 states and 2399 transitions. [2018-12-30 15:48:55,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:48:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2399 transitions. [2018-12-30 15:48:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 15:48:55,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:55,359 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] [2018-12-30 15:48:55,359 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash -770819741, now seen corresponding path program 1 times [2018-12-30 15:48:55,360 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:55,360 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 [2018-12-30 15:48:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:55,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-30 15:48:55,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-30 15:48:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-30 15:48:56,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 15:48:56,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-30 15:48:56,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 15:48:56,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 15:48:56,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:48:56,027 INFO L87 Difference]: Start difference. First operand 1664 states and 2399 transitions. Second operand 12 states. [2018-12-30 15:48:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:57,155 INFO L93 Difference]: Finished difference Result 2849 states and 4103 transitions. [2018-12-30 15:48:57,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 15:48:57,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-12-30 15:48:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:57,163 INFO L225 Difference]: With dead ends: 2849 [2018-12-30 15:48:57,164 INFO L226 Difference]: Without dead ends: 2055 [2018-12-30 15:48:57,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-12-30 15:48:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2018-12-30 15:48:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1692. [2018-12-30 15:48:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1692 states. [2018-12-30 15:48:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2406 transitions. [2018-12-30 15:48:57,306 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2406 transitions. Word has length 50 [2018-12-30 15:48:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:57,307 INFO L480 AbstractCegarLoop]: Abstraction has 1692 states and 2406 transitions. [2018-12-30 15:48:57,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 15:48:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2406 transitions. [2018-12-30 15:48:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-30 15:48:57,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:57,309 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] [2018-12-30 15:48:57,309 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash 928939180, now seen corresponding path program 1 times [2018-12-30 15:48:57,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 15:48:57,310 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 [2018-12-30 15:48:57,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 15:48:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 15:48:57,542 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 15:48:57,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 03:48:57 BoogieIcfgContainer [2018-12-30 15:48:57,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 15:48:57,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 15:48:57,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 15:48:57,604 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 15:48:57,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:48:21" (3/4) ... [2018-12-30 15:48:57,611 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 15:48:57,799 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 15:48:57,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 15:48:57,800 INFO L168 Benchmark]: Toolchain (without parser) took 37984.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -390.4 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:57,801 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:48:57,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:57,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.61 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:48:57,808 INFO L168 Benchmark]: Boogie Preprocessor took 170.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:57,809 INFO L168 Benchmark]: RCFGBuilder took 730.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:57,809 INFO L168 Benchmark]: TraceAbstraction took 36397.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -244.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:57,812 INFO L168 Benchmark]: Witness Printer took 196.21 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-30 15:48:57,819 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.52 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 418.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 65.61 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 170.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 730.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36397.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -244.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Witness Printer took 196.21 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. 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, 41 locations, 1 error locations. UNSAFE Result, 36.3s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1834 SDtfs, 5598 SDslu, 8616 SDs, 0 SdLazy, 7179 SolverSat, 640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 736 GetRequests, 569 SyntacticMatches, 3 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1692occurred 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.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 3295 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 277423 SizeOfPredicates, 52 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 125/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...