./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c -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 d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:04:51,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:04:51,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:04:51,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:04:51,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:04:51,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:04:51,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:04:51,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:04:51,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:04:51,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:04:51,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:04:51,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:04:51,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:04:51,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:04:51,227 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:04:51,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:04:51,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:04:51,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:04:51,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:04:51,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:04:51,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:04:51,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:04:51,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:04:51,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:04:51,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:04:51,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:04:51,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:04:51,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:04:51,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:04:51,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:04:51,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:04:51,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:04:51,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:04:51,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:04:51,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:04:51,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:04:51,248 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:04:51,263 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:04:51,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:04:51,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:04:51,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:04:51,264 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:04:51,265 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:04:51,265 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:04:51,266 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:04:51,266 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:04:51,266 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:04:51,266 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:04:51,266 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:04:51,266 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:04:51,267 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:04:51,267 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:04:51,268 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:04:51,268 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:04:51,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:04:51,268 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:04:51,268 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:04:51,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:04:51,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:04:51,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:04:51,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:04:51,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:04:51,269 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:04:51,269 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:04:51,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:04:51,271 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 -> d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 [2019-01-12 15:04:51,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:04:51,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:04:51,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:04:51,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:04:51,333 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:04:51,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:04:51,398 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569b767ad/d0f35d8a49424b42b1e6caeb952be831/FLAG51dda411e [2019-01-12 15:04:51,783 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:04:51,784 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:04:51,789 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569b767ad/d0f35d8a49424b42b1e6caeb952be831/FLAG51dda411e [2019-01-12 15:04:52,159 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569b767ad/d0f35d8a49424b42b1e6caeb952be831 [2019-01-12 15:04:52,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:04:52,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:04:52,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:04:52,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:04:52,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:04:52,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68284f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52, skipping insertion in model container [2019-01-12 15:04:52,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:04:52,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:04:52,413 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:04:52,417 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:04:52,436 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:04:52,450 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:04:52,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52 WrapperNode [2019-01-12 15:04:52,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:04:52,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:04:52,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:04:52,452 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:04:52,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:04:52,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:04:52,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:04:52,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:04:52,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... [2019-01-12 15:04:52,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:04:52,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:04:52,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:04:52,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:04:52,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:04:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:04:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:04:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 15:04:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 15:04:52,807 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:04:52,807 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:04:52,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:04:52 BoogieIcfgContainer [2019-01-12 15:04:52,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:04:52,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:04:52,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:04:52,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:04:52,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:04:52" (1/3) ... [2019-01-12 15:04:52,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5528ed67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:04:52, skipping insertion in model container [2019-01-12 15:04:52,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:04:52" (2/3) ... [2019-01-12 15:04:52,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5528ed67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:04:52, skipping insertion in model container [2019-01-12 15:04:52,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:04:52" (3/3) ... [2019-01-12 15:04:52,819 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o20_false-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:04:52,828 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:04:52,836 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:04:52,850 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:04:52,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:04:52,879 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:04:52,880 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:04:52,880 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:04:52,880 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:04:52,880 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:04:52,880 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:04:52,880 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:04:52,880 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:04:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 15:04:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:04:52,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:52,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:52,908 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 15:04:52,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:52,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:52,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:52,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:04:52,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:04:53,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:04:53,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:04:53,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:04:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:04:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:04:53,307 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 15:04:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:53,395 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-01-12 15:04:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:04:53,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:04:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:53,407 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:04:53,407 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 15:04:53,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:04:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 15:04:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 15:04:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 15:04:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 15:04:53,446 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 15:04:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:53,447 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 15:04:53,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:04:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 15:04:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:04:53,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:53,449 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:53,450 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:53,450 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 15:04:53,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:53,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:53,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:04:53,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:04:53,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:53,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:53,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:04:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:53,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:04:53,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:53,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 15:04:53,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:04:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:04:53,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:04:53,906 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2019-01-12 15:04:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:54,126 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 15:04:54,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:04:54,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 15:04:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:54,127 INFO L225 Difference]: With dead ends: 21 [2019-01-12 15:04:54,128 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:04:54,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:04:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:04:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:04:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:04:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 15:04:54,134 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 15:04:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:54,135 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 15:04:54,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:04:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 15:04:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:04:54,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:54,136 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:54,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 15:04:54,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:54,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:54,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:04:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:04:54,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:54,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:54,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:04:54,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:04:54,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:04:54,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:04:54,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:54,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 15:04:54,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:04:54,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:04:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:04:54,795 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-01-12 15:04:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:54,922 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 15:04:54,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:04:54,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-01-12 15:04:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:54,924 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:04:54,924 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:04:54,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:04:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:04:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:04:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:04:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 15:04:54,931 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 15:04:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:54,932 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 15:04:54,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:04:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 15:04:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:04:54,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:54,933 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:54,934 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 15:04:54,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:54,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:54,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:04:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:04:55,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:55,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:04:55,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:04:55,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:04:55,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:04:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:55,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 15:04:55,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:04:55,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:04:55,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:04:55,617 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 12 states. [2019-01-12 15:04:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:55,766 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 15:04:55,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:04:55,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-12 15:04:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:55,769 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:04:55,769 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 15:04:55,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:04:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 15:04:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 15:04:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:04:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 15:04:55,777 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 15:04:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:55,777 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 15:04:55,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:04:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 15:04:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:04:55,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:55,779 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:55,780 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 15:04:55,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:55,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:55,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:55,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:04:55,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:04:56,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:56,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:56,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:04:56,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:04:56,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:04:56,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:04:56,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:56,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-01-12 15:04:56,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:04:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:04:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:04:56,260 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 14 states. [2019-01-12 15:04:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:56,373 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 15:04:56,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:04:56,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-01-12 15:04:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:56,377 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:04:56,377 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:04:56,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:04:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:04:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:04:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:04:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 15:04:56,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 15:04:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:56,384 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 15:04:56,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:04:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 15:04:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:04:56,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:56,385 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:56,386 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 15:04:56,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:56,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:56,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:04:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:04:56,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:56,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:56,728 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:04:56,834 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 15:04:56,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:04:56,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:04:56,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:56,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-01-12 15:04:56,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 15:04:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 15:04:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:04:56,915 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 16 states. [2019-01-12 15:04:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:57,074 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 15:04:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:04:57,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-01-12 15:04:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:57,076 INFO L225 Difference]: With dead ends: 33 [2019-01-12 15:04:57,076 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 15:04:57,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:04:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 15:04:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 15:04:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:04:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 15:04:57,083 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 15:04:57,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:57,084 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 15:04:57,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 15:04:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 15:04:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:04:57,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:57,085 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:57,086 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:57,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 15:04:57,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:57,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:57,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:57,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:04:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:04:57,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:57,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:57,608 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:04:57,634 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 15:04:57,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:04:57,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:04:57,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:57,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-01-12 15:04:57,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:04:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:04:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:04:57,735 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 18 states. [2019-01-12 15:04:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:58,042 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 15:04:58,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 15:04:58,042 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-01-12 15:04:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:58,044 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:04:58,044 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:04:58,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:04:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:04:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 15:04:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:04:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 15:04:58,051 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 15:04:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:58,051 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 15:04:58,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:04:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 15:04:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:04:58,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:58,053 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:58,054 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:58,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:58,054 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 15:04:58,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:58,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:58,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:58,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:04:58,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:04:58,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:58,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:58,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:04:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:58,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:04:58,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:58,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-01-12 15:04:58,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:04:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:04:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:04:58,649 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 20 states. [2019-01-12 15:04:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:58,826 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 15:04:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:04:58,827 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-01-12 15:04:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:58,828 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:04:58,828 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:04:58,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:04:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:04:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:04:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:04:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:04:58,835 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 15:04:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:58,835 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:04:58,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:04:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:04:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:04:58,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:58,837 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:58,837 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 15:04:58,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:58,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:58,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:58,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:04:58,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:04:59,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:59,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:59,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:04:59,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:04:59,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:04:59,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:04:59,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:59,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-01-12 15:04:59,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 15:04:59,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 15:04:59,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:04:59,656 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 22 states. [2019-01-12 15:04:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:59,894 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 15:04:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 15:04:59,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-01-12 15:04:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:59,897 INFO L225 Difference]: With dead ends: 42 [2019-01-12 15:04:59,897 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:04:59,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:04:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:04:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 15:04:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:04:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 15:04:59,903 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 15:04:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:59,904 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 15:04:59,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 15:04:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 15:04:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:04:59,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:59,905 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:59,906 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:59,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 15:04:59,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:59,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:59,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:59,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:04:59,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:05:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:05:00,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:05:00,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:05:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:05:00,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 15:05:00,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:05:00,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:05:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:05:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:05:00,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-01-12 15:05:00,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 15:05:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 15:05:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:05:00,826 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2019-01-12 15:05:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:05:01,067 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 15:05:01,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 15:05:01,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2019-01-12 15:05:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:05:01,070 INFO L225 Difference]: With dead ends: 45 [2019-01-12 15:05:01,070 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 15:05:01,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:05:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 15:05:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 15:05:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 15:05:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 15:05:01,077 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 15:05:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:05:01,077 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 15:05:01,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 15:05:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 15:05:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 15:05:01,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:05:01,079 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:05:01,079 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:05:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:05:01,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 15:05:01,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:05:01,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:05:01,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:05:01,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:05:01,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:05:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:05:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:05:01,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:05:01,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:05:01,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:05:01,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:05:01,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:05:01,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:05:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:05:01,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:05:01,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-01-12 15:05:01,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 15:05:01,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 15:05:01,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:05:01,773 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 26 states. [2019-01-12 15:05:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:05:02,285 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 15:05:02,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 15:05:02,286 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-01-12 15:05:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:05:02,287 INFO L225 Difference]: With dead ends: 48 [2019-01-12 15:05:02,287 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 15:05:02,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:05:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 15:05:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 15:05:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:05:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 15:05:02,300 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 15:05:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:05:02,301 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 15:05:02,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 15:05:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 15:05:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:05:02,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:05:02,305 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:05:02,305 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:05:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:05:02,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 15:05:02,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:05:02,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:05:02,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:05:02,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:05:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:05:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:05:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:05:03,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:05:03,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:05:03,110 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:05:43,531 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 15:05:43,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:05:47,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:05:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:05:47,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:05:47,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-01-12 15:05:47,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 15:05:47,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 15:05:47,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:05:47,707 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 28 states. [2019-01-12 15:05:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:05:48,097 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 15:05:48,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 15:05:48,099 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-01-12 15:05:48,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:05:48,100 INFO L225 Difference]: With dead ends: 51 [2019-01-12 15:05:48,100 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 15:05:48,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:05:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 15:05:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 15:05:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 15:05:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 15:05:48,107 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 15:05:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:05:48,108 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 15:05:48,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 15:05:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 15:05:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 15:05:48,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:05:48,109 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:05:48,110 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:05:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:05:48,112 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 15:05:48,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:05:48,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:05:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:05:48,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:05:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:05:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:05:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:05:48,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:05:48,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:05:48,703 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:06:28,934 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 15:06:28,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:06:28,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:06:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:06:29,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:06:29,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-01-12 15:06:29,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-12 15:06:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-12 15:06:29,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:06:29,072 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 30 states. [2019-01-12 15:06:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:06:29,662 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 15:06:29,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 15:06:29,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 81 [2019-01-12 15:06:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:06:29,666 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:06:29,666 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:06:29,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:06:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:06:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 15:06:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 15:06:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 15:06:29,685 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 15:06:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:06:29,686 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 15:06:29,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-12 15:06:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 15:06:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:06:29,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:06:29,688 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:06:29,688 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:06:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:06:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 15:06:29,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:06:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:06:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:29,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:06:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:06:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:06:30,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:06:30,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:06:30,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:06:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:06:30,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:06:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:06:30,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:06:30,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-01-12 15:06:30,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 15:06:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 15:06:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:06:30,977 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 32 states. [2019-01-12 15:06:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:06:31,382 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 15:06:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 15:06:31,383 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 87 [2019-01-12 15:06:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:06:31,385 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:06:31,385 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:06:31,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:06:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:06:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 15:06:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:06:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 15:06:31,393 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 15:06:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:06:31,393 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 15:06:31,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 15:06:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 15:06:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:06:31,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:06:31,396 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:06:31,396 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:06:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:06:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 15:06:31,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:06:31,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:06:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:31,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:06:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:06:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:06:32,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:06:32,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:06:32,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:06:32,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:06:32,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:06:32,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:06:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:06:32,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:06:32,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-01-12 15:06:32,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-12 15:06:32,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-12 15:06:32,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:06:32,727 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 34 states. [2019-01-12 15:06:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:06:33,298 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 15:06:33,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 15:06:33,299 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2019-01-12 15:06:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:06:33,301 INFO L225 Difference]: With dead ends: 60 [2019-01-12 15:06:33,301 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 15:06:33,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:06:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 15:06:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 15:06:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 15:06:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 15:06:33,309 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 15:06:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:06:33,311 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 15:06:33,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-12 15:06:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 15:06:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:06:33,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:06:33,312 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:06:33,312 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:06:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:06:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 15:06:33,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:06:33,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:06:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:33,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:06:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:06:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:06:34,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:06:34,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:06:34,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:06:47,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 15:06:47,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:06:47,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:06:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:06:47,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:06:47,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-01-12 15:06:47,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 15:06:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 15:06:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:06:47,891 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 36 states. [2019-01-12 15:06:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:06:48,419 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 15:06:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 15:06:48,420 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2019-01-12 15:06:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:06:48,422 INFO L225 Difference]: With dead ends: 63 [2019-01-12 15:06:48,422 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 15:06:48,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:06:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 15:06:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 15:06:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 15:06:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 15:06:48,431 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 15:06:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:06:48,433 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 15:06:48,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 15:06:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 15:06:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:06:48,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:06:48,435 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:06:48,435 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:06:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:06:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 15:06:48,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:06:48,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:06:48,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:48,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:06:48,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:06:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:06:49,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:06:49,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:06:49,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:06:49,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:06:49,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:06:49,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:06:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:06:49,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:06:49,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-01-12 15:06:49,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-12 15:06:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-12 15:06:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:06:49,308 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 38 states. [2019-01-12 15:06:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:06:49,895 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-01-12 15:06:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 15:06:49,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2019-01-12 15:06:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:06:49,897 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:06:49,897 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 15:06:49,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:06:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 15:06:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-12 15:06:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 15:06:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-01-12 15:06:49,904 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-01-12 15:06:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:06:49,905 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-01-12 15:06:49,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-12 15:06:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-01-12 15:06:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 15:06:49,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:06:49,908 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:06:49,909 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:06:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:06:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-01-12 15:06:49,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:06:49,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:06:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:49,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:06:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:06:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:06:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:06:51,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:06:51,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:06:51,612 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:09:02,088 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 15:09:02,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:07,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:09:07,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:07,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-01-12 15:09:07,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-12 15:09:07,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-12 15:09:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:09:07,668 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 40 states. [2019-01-12 15:09:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:09,058 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-01-12 15:09:09,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 15:09:09,059 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 111 [2019-01-12 15:09:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:09,061 INFO L225 Difference]: With dead ends: 69 [2019-01-12 15:09:09,061 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 15:09:09,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:09:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 15:09:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-12 15:09:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 15:09:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-12 15:09:09,073 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-01-12 15:09:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:09,075 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-12 15:09:09,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-12 15:09:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-12 15:09:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:09:09,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:09,076 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:09,076 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:09,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:09,077 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-01-12 15:09:09,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:09,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:09,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:09:10,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:10,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:10,866 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:09:53,474 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 15:09:53,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:53,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:09:53,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:53,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-01-12 15:09:53,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-12 15:09:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-12 15:09:53,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 15:09:53,795 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 42 states. [2019-01-12 15:09:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:54,577 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-12 15:09:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-12 15:09:54,579 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 117 [2019-01-12 15:09:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:54,581 INFO L225 Difference]: With dead ends: 72 [2019-01-12 15:09:54,581 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 15:09:54,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 15:09:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 15:09:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 15:09:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 15:09:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 15:09:54,587 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-01-12 15:09:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:54,588 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 15:09:54,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-12 15:09:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 15:09:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 15:09:54,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:54,589 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:54,589 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:54,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:54,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-01-12 15:09:54,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:54,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:54,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:54,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:54,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:09:56,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:56,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:56,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:56,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:09:56,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:56,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-01-12 15:09:56,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-12 15:09:56,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-12 15:09:56,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:09:56,775 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 44 states. [2019-01-12 15:09:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:57,623 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-12 15:09:57,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-12 15:09:57,624 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 123 [2019-01-12 15:09:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:57,626 INFO L225 Difference]: With dead ends: 75 [2019-01-12 15:09:57,626 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 15:09:57,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:09:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 15:09:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 15:09:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 15:09:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-12 15:09:57,632 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-01-12 15:09:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:57,632 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-12 15:09:57,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-12 15:09:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-12 15:09:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 15:09:57,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:57,633 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:57,636 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-01-12 15:09:57,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:57,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:57,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:09:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:09:57,897 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 15:09:57,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:09:57 BoogieIcfgContainer [2019-01-12 15:09:57,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:09:57,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:09:57,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:09:57,962 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:09:57,966 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:04:52" (3/4) ... [2019-01-12 15:09:57,969 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 15:09:58,091 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:09:58,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:09:58,093 INFO L168 Benchmark]: Toolchain (without parser) took 305930.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -110.7 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:58,096 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:09:58,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.19 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:58,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.20 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. [2019-01-12 15:09:58,101 INFO L168 Benchmark]: Boogie Preprocessor took 22.42 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. [2019-01-12 15:09:58,102 INFO L168 Benchmark]: RCFGBuilder took 298.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -118.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:58,102 INFO L168 Benchmark]: TraceAbstraction took 305150.84 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.8 MB). Peak memory consumption was 84.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:58,111 INFO L168 Benchmark]: Witness Printer took 130.45 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: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:58,116 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.18 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 286.19 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 36.20 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 22.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 298.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -118.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 305150.84 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.8 MB). Peak memory consumption was 84.1 MB. Max. memory is 11.5 GB. * Witness Printer took 130.45 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: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 305.0s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 603 SDtfs, 3 SDslu, 12984 SDs, 0 SdLazy, 8810 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1772 GetRequests, 1294 SyntacticMatches, 19 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 268.2s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2592 ConstructedInterpolants, 0 QuantifiedInterpolants, 872432 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2698 ConjunctsInSsa, 912 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...