./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_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 561472dda653ab23fa8eff641224e01683fc61ba ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-91b1670 [2018-11-28 18:16:46,301 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:16:46,303 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:16:46,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:16:46,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:16:46,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:16:46,325 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:16:46,327 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:16:46,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:16:46,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:16:46,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:16:46,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:16:46,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:16:46,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:16:46,350 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:16:46,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:16:46,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:16:46,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:16:46,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:16:46,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:16:46,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:16:46,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:16:46,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:16:46,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:16:46,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:16:46,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:16:46,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:16:46,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:16:46,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:16:46,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:16:46,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:16:46,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:16:46,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:16:46,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:16:46,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:16:46,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:16:46,379 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:16:46,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:16:46,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:16:46,395 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:16:46,395 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:16:46,397 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:16:46,397 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:16:46,397 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:16:46,397 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:16:46,397 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:16:46,398 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:16:46,398 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:16:46,398 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:16:46,398 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:16:46,398 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:16:46,398 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:16:46,399 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:16:46,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:16:46,400 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:16:46,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:16:46,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:16:46,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:16:46,401 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:16:46,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:16:46,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:16:46,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:16:46,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:16:46,402 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:16:46,402 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:16:46,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:16:46,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:16:46,404 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 -> 561472dda653ab23fa8eff641224e01683fc61ba [2018-11-28 18:16:46,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:16:46,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:16:46,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:16:46,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:16:46,468 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:16:46,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-28 18:16:46,529 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33df4485a/806b72cefb8f4359be096ca31fafdb96/FLAGefd6ad246 [2018-11-28 18:16:46,999 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:16:47,001 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-28 18:16:47,009 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33df4485a/806b72cefb8f4359be096ca31fafdb96/FLAGefd6ad246 [2018-11-28 18:16:47,337 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33df4485a/806b72cefb8f4359be096ca31fafdb96 [2018-11-28 18:16:47,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:16:47,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:16:47,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:16:47,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:16:47,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:16:47,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3041e472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47, skipping insertion in model container [2018-11-28 18:16:47,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:16:47,381 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:16:47,576 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:16:47,582 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:16:47,606 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:16:47,628 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:16:47,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47 WrapperNode [2018-11-28 18:16:47,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:16:47,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:16:47,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:16:47,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:16:47,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:16:47,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:16:47,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:16:47,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:16:47,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... [2018-11-28 18:16:47,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:16:47,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:16:47,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:16:47,684 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:16:47,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:16:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:16:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:16:47,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:16:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:16:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:16:47,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:16:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:16:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:16:47,813 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:16:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 18:16:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 18:16:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:16:48,224 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:16:48,224 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 18:16:48,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:16:48 BoogieIcfgContainer [2018-11-28 18:16:48,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:16:48,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:16:48,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:16:48,230 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:16:48,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:16:47" (1/3) ... [2018-11-28 18:16:48,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a62fcb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:16:48, skipping insertion in model container [2018-11-28 18:16:48,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:16:47" (2/3) ... [2018-11-28 18:16:48,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a62fcb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:16:48, skipping insertion in model container [2018-11-28 18:16:48,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:16:48" (3/3) ... [2018-11-28 18:16:48,233 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-28 18:16:48,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:16:48,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:16:48,269 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:16:48,299 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:16:48,300 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:16:48,300 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:16:48,300 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:16:48,301 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:16:48,301 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:16:48,301 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:16:48,301 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:16:48,301 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:16:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-28 18:16:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:16:48,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:16:48,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:16:48,330 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:16:48,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:16:48,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-28 18:16:48,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:16:48,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:16:48,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:48,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:16:48,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:16:48,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:16:48,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:16:48,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:16:48,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:16:48,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:16:48,508 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-28 18:16:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:16:48,534 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-28 18:16:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:16:48,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-28 18:16:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:16:48,546 INFO L225 Difference]: With dead ends: 46 [2018-11-28 18:16:48,546 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 18:16:48,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:16:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 18:16:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 18:16:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 18:16:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-28 18:16:48,595 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-28 18:16:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:16:48,596 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 18:16:48,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:16:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-28 18:16:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:16:48,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:16:48,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:16:48,598 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:16:48,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:16:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-28 18:16:48,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:16:48,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:16:48,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:48,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:16:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:16:48,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:16:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:16:48,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:16:48,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:16:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:16:48,824 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2018-11-28 18:16:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:16:49,058 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-28 18:16:49,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:16:49,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-28 18:16:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:16:49,060 INFO L225 Difference]: With dead ends: 34 [2018-11-28 18:16:49,060 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:16:49,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:16:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:16:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 18:16:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 18:16:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-28 18:16:49,072 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-28 18:16:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:16:49,073 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-28 18:16:49,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:16:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-28 18:16:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 18:16:49,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:16:49,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:16:49,074 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:16:49,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:16:49,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2018-11-28 18:16:49,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:16:49,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:16:49,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:49,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:16:49,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:16:49,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:16:49,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:16:49,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:16:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:16:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:16:49,162 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-28 18:16:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:16:49,279 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 18:16:49,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:16:49,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 18:16:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:16:49,281 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:16:49,281 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 18:16:49,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:16:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 18:16:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-28 18:16:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 18:16:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-28 18:16:49,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-11-28 18:16:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:16:49,295 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-28 18:16:49,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:16:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-28 18:16:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:16:49,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:16:49,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:16:49,298 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:16:49,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:16:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2018-11-28 18:16:49,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:16:49,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:16:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:49,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:16:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:50,278 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2018-11-28 18:16:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:16:50,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:16:50,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:16:50,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:16:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:50,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:16:50,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 18:16:50,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:50,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:50,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-28 18:16:50,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-11-28 18:16:50,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 18:16:50,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:50,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:50,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:50,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 18:16:51,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 18:16:51,109 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:16:51,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 18:16:51,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:51,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:16:51,123 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:51,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:51,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:51,141 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-28 18:16:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:16:51,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:16:51,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-28 18:16:51,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 18:16:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 18:16:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:16:51,223 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 19 states. [2018-11-28 18:16:51,546 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 18:16:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:16:52,403 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 18:16:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:16:52,404 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-28 18:16:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:16:52,409 INFO L225 Difference]: With dead ends: 46 [2018-11-28 18:16:52,409 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 18:16:52,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-11-28 18:16:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 18:16:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-28 18:16:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 18:16:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 18:16:52,424 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-11-28 18:16:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:16:52,424 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 18:16:52,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 18:16:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-28 18:16:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 18:16:52,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:16:52,425 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:16:52,426 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:16:52,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:16:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash 64185792, now seen corresponding path program 2 times [2018-11-28 18:16:52,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:16:52,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:16:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:52,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:16:52,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:16:52,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:16:52,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:16:52,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:16:52,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:16:52,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:16:52,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:16:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:16:52,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:16:52,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-28 18:16:52,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:16:52,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:16:52,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:16:52,599 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2018-11-28 18:16:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:16:52,811 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-28 18:16:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:16:52,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 18:16:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:16:52,814 INFO L225 Difference]: With dead ends: 57 [2018-11-28 18:16:52,814 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 18:16:52,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:16:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 18:16:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-11-28 18:16:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 18:16:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 18:16:52,824 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2018-11-28 18:16:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:16:52,824 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 18:16:52,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:16:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 18:16:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 18:16:52,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:16:52,825 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-11-28 18:16:52,826 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:16:52,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:16:52,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 3 times [2018-11-28 18:16:52,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:16:52,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:16:52,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:52,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:16:52,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:53,147 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-11-28 18:16:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:16:53,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:16:53,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:16:53,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:16:53,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 18:16:53,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:16:53,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:16:53,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 18:16:53,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:53,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:53,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-28 18:16:53,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-28 18:16:53,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 18:16:53,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:53,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:53,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:53,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-11-28 18:16:53,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-28 18:16:53,980 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:16:53,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 18:16:53,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:53,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:16:53,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:53,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:54,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:54,003 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-28 18:16:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:16:54,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:16:54,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-11-28 18:16:54,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 18:16:54,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 18:16:54,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-28 18:16:54,060 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 24 states. [2018-11-28 18:16:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:16:56,238 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-11-28 18:16:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 18:16:56,240 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-28 18:16:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:16:56,244 INFO L225 Difference]: With dead ends: 85 [2018-11-28 18:16:56,244 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 18:16:56,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=341, Invalid=1551, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 18:16:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 18:16:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 46. [2018-11-28 18:16:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 18:16:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-28 18:16:56,258 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 23 [2018-11-28 18:16:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:16:56,258 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-28 18:16:56,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 18:16:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-28 18:16:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:16:56,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:16:56,259 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:16:56,260 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:16:56,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:16:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash -96694823, now seen corresponding path program 1 times [2018-11-28 18:16:56,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:16:56,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:16:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:56,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:16:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:16:56,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:16:56,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:16:56,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:16:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:56,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:16:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:16:56,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:16:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 18:16:56,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:16:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:16:56,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:16:56,763 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 10 states. [2018-11-28 18:16:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:16:56,910 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-28 18:16:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:16:56,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-28 18:16:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:16:56,913 INFO L225 Difference]: With dead ends: 73 [2018-11-28 18:16:56,913 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 18:16:56,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:16:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 18:16:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2018-11-28 18:16:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 18:16:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-28 18:16:56,928 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 27 [2018-11-28 18:16:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:16:56,928 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-28 18:16:56,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:16:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-28 18:16:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:16:56,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:16:56,929 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:16:56,930 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:16:56,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:16:56,930 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 4 times [2018-11-28 18:16:56,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:16:56,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:16:56,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:56,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:16:56,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:16:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:16:57,491 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-11-28 18:16:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:16:57,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:16:57,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:16:57,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:16:57,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:16:57,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:16:58,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:16:58,198 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-11-28 18:16:58,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2018-11-28 18:16:58,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-28 18:16:58,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-28 18:16:58,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-11-28 18:16:58,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:16:58,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-11-28 18:16:58,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-28 18:16:58,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2018-11-28 18:16:58,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:16:58,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:16:58,597 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:16:58,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-28 18:16:58,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:16:58,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:3 [2018-11-28 18:16:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 18:16:58,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:16:58,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2018-11-28 18:16:58,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 18:16:58,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 18:16:58,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2018-11-28 18:16:58,714 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 28 states. [2018-11-28 18:17:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:00,859 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-11-28 18:17:00,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 18:17:00,860 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-11-28 18:17:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:00,864 INFO L225 Difference]: With dead ends: 109 [2018-11-28 18:17:00,864 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 18:17:00,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=387, Invalid=2063, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 18:17:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 18:17:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 49. [2018-11-28 18:17:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 18:17:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-28 18:17:00,879 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-11-28 18:17:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:00,880 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-28 18:17:00,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 18:17:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-28 18:17:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:17:00,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:00,881 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:00,881 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:00,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:00,881 INFO L82 PathProgramCache]: Analyzing trace with hash 60600405, now seen corresponding path program 2 times [2018-11-28 18:17:00,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:00,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:00,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:00,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:17:00,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:17:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:17:00,945 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:17:00,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:17:00 BoogieIcfgContainer [2018-11-28 18:17:00,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:17:00,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:17:00,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:17:00,986 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:17:00,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:16:48" (3/4) ... [2018-11-28 18:17:00,989 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:17:01,057 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:17:01,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:17:01,058 INFO L168 Benchmark]: Toolchain (without parser) took 13716.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 951.4 MB in the beginning and 965.3 MB in the end (delta: -13.9 MB). Peak memory consumption was 303.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:01,059 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:17:01,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.34 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:01,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:17:01,060 INFO L168 Benchmark]: Boogie Preprocessor took 29.73 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-11-28 18:17:01,061 INFO L168 Benchmark]: RCFGBuilder took 542.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:01,062 INFO L168 Benchmark]: TraceAbstraction took 12759.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 965.3 MB in the end (delta: 136.9 MB). Peak memory consumption was 320.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:17:01,062 INFO L168 Benchmark]: Witness Printer took 71.44 ms. Allocated memory is still 1.3 GB. Free memory is still 965.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:17:01,066 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.32 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 285.34 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 23.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.73 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. * RCFGBuilder took 542.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12759.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 965.3 MB in the end (delta: 136.9 MB). Peak memory consumption was 320.9 MB. Max. memory is 11.5 GB. * Witness Printer took 71.44 ms. Allocated memory is still 1.3 GB. Free memory is still 965.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int MAX = __VERIFIER_nondet_uint(); [L16] char str1[MAX], str2[MAX]; [L17] int cont, i, j; [L18] cont = 0 [L20] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={5:0}] [L20] COND TRUE i= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L27] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L27] COND TRUE i >= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L27] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L27] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L32] j = MAX-1 [L33] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L33] COND TRUE i