./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test24_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-regression/test24_false-unreach-call.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 45294379b83c6b60e0b0199955cdf7244f057430 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:23:15,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:23:15,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:23:15,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:23:15,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:23:15,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:23:15,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:23:15,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:23:15,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:23:15,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:23:15,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:23:15,259 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:23:15,260 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:23:15,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:23:15,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:23:15,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:23:15,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:23:15,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:23:15,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:23:15,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:23:15,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:23:15,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:23:15,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:23:15,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:23:15,293 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:23:15,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:23:15,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:23:15,295 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:23:15,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:23:15,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:23:15,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:23:15,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:23:15,298 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:23:15,298 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:23:15,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:23:15,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:23:15,300 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:23:15,319 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:23:15,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:23:15,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:23:15,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:23:15,324 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:23:15,325 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:23:15,325 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:23:15,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:23:15,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:23:15,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:23:15,326 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:23:15,326 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:23:15,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:23:15,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:23:15,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:23:15,326 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:23:15,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:23:15,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:23:15,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:23:15,330 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:23:15,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:23:15,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:23:15,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:23:15,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:23:15,332 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:23:15,332 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:23:15,332 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:23:15,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:23:15,333 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 -> 45294379b83c6b60e0b0199955cdf7244f057430 [2018-12-31 04:23:15,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:23:15,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:23:15,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:23:15,401 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:23:15,402 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:23:15,404 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test24_false-unreach-call.c [2018-12-31 04:23:15,466 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cfa1d05/3d3643ca6ff64fd1b321825ad78a4675/FLAGa27f35d6f [2018-12-31 04:23:15,887 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:23:15,888 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test24_false-unreach-call.c [2018-12-31 04:23:15,895 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cfa1d05/3d3643ca6ff64fd1b321825ad78a4675/FLAGa27f35d6f [2018-12-31 04:23:16,268 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cfa1d05/3d3643ca6ff64fd1b321825ad78a4675 [2018-12-31 04:23:16,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:23:16,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:23:16,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:23:16,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:23:16,282 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:23:16,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f73e463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16, skipping insertion in model container [2018-12-31 04:23:16,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:23:16,327 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:23:16,589 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:23:16,603 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:23:16,629 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:23:16,646 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:23:16,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16 WrapperNode [2018-12-31 04:23:16,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:23:16,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:23:16,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:23:16,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:23:16,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:23:16,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:23:16,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:23:16,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:23:16,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:23:16,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:23:16,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:23:16,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:23:16,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:23:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:23:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:23:16,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:23:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:23:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:23:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:23:17,300 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:23:17,300 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 04:23:17,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:17 BoogieIcfgContainer [2018-12-31 04:23:17,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:23:17,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:23:17,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:23:17,305 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:23:17,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:23:16" (1/3) ... [2018-12-31 04:23:17,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3757a6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:23:17, skipping insertion in model container [2018-12-31 04:23:17,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16" (2/3) ... [2018-12-31 04:23:17,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3757a6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:23:17, skipping insertion in model container [2018-12-31 04:23:17,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:17" (3/3) ... [2018-12-31 04:23:17,309 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_false-unreach-call.c [2018-12-31 04:23:17,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:23:17,336 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:23:17,357 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:23:17,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:23:17,390 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:23:17,390 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:23:17,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:23:17,391 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:23:17,391 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:23:17,391 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:23:17,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:23:17,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:23:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-31 04:23:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:23:17,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:17,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:17,417 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:17,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1829445793, now seen corresponding path program 1 times [2018-12-31 04:23:17,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:17,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:17,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:17,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:17,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:23:17,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:23:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:23:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:23:17,596 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-12-31 04:23:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:17,613 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2018-12-31 04:23:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:23:17,615 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 04:23:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:17,624 INFO L225 Difference]: With dead ends: 30 [2018-12-31 04:23:17,624 INFO L226 Difference]: Without dead ends: 13 [2018-12-31 04:23:17,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:23:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-31 04:23:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-31 04:23:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-31 04:23:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-31 04:23:17,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-31 04:23:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:17,661 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-31 04:23:17,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:23:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-31 04:23:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:23:17,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:17,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:17,662 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash 672236885, now seen corresponding path program 1 times [2018-12-31 04:23:17,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:17,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:17,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:17,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:17,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:23:17,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:23:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:23:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:23:17,731 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-12-31 04:23:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:17,766 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-31 04:23:17,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:23:17,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-31 04:23:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:17,768 INFO L225 Difference]: With dead ends: 24 [2018-12-31 04:23:17,768 INFO L226 Difference]: Without dead ends: 15 [2018-12-31 04:23:17,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:23:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-31 04:23:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-31 04:23:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-31 04:23:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-31 04:23:17,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-12-31 04:23:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:17,774 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-31 04:23:17,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:23:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-31 04:23:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 04:23:17,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:17,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:17,776 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:17,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1835948819, now seen corresponding path program 1 times [2018-12-31 04:23:17,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:17,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:17,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:17,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:17,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:17,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:17,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:17,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:17,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:18,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:18,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 04:23:18,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:23:18,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:23:18,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:23:18,032 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-12-31 04:23:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:18,090 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-31 04:23:18,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:23:18,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-31 04:23:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:18,092 INFO L225 Difference]: With dead ends: 26 [2018-12-31 04:23:18,092 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 04:23:18,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:23:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 04:23:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-31 04:23:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 04:23:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-31 04:23:18,098 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2018-12-31 04:23:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:18,098 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-31 04:23:18,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:23:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-31 04:23:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:23:18,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:18,100 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:18,100 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:18,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash -823346863, now seen corresponding path program 2 times [2018-12-31 04:23:18,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:18,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:18,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:18,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:18,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:18,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:23:18,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:23:18,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:18,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:18,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:18,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-31 04:23:18,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:23:18,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:23:18,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:23:18,415 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2018-12-31 04:23:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:18,501 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-12-31 04:23:18,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:23:18,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-31 04:23:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:18,504 INFO L225 Difference]: With dead ends: 28 [2018-12-31 04:23:18,504 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 04:23:18,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:23:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 04:23:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-31 04:23:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-31 04:23:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-31 04:23:18,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-12-31 04:23:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:18,510 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-31 04:23:18,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:23:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-31 04:23:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 04:23:18,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:18,511 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:18,511 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash -900956145, now seen corresponding path program 3 times [2018-12-31 04:23:18,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:18,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:18,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:18,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:18,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:18,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:18,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 04:23:18,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 04:23:18,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:18,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:18,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:18,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-31 04:23:18,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:23:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:23:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:23:18,946 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2018-12-31 04:23:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:18,990 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-12-31 04:23:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:23:18,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-31 04:23:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:18,991 INFO L225 Difference]: With dead ends: 30 [2018-12-31 04:23:18,992 INFO L226 Difference]: Without dead ends: 21 [2018-12-31 04:23:18,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:23:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-31 04:23:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-31 04:23:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 04:23:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-31 04:23:18,997 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-12-31 04:23:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:18,998 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-31 04:23:18,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:23:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-31 04:23:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:23:18,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:18,999 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:18,999 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1825935181, now seen corresponding path program 4 times [2018-12-31 04:23:19,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:19,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:19,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:19,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:19,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:19,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:19,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 04:23:19,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 04:23:19,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:19,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:19,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:19,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-31 04:23:19,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:23:19,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:23:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:23:19,314 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2018-12-31 04:23:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:19,377 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-31 04:23:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 04:23:19,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-31 04:23:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:19,381 INFO L225 Difference]: With dead ends: 32 [2018-12-31 04:23:19,381 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 04:23:19,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:23:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 04:23:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-31 04:23:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 04:23:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-31 04:23:19,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2018-12-31 04:23:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:19,386 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-31 04:23:19,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:23:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-31 04:23:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:23:19,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:19,388 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:19,388 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1856518389, now seen corresponding path program 5 times [2018-12-31 04:23:19,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:19,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:19,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:19,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:19,703 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 04:23:19,806 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-31 04:23:19,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:19,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:19,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:19,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-31 04:23:19,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 04:23:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 04:23:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:23:19,953 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 9 states. [2018-12-31 04:23:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:20,183 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-31 04:23:20,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 04:23:20,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-31 04:23:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:20,184 INFO L225 Difference]: With dead ends: 34 [2018-12-31 04:23:20,185 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:23:20,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:23:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:23:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-31 04:23:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 04:23:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-31 04:23:20,189 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-12-31 04:23:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:20,190 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-31 04:23:20,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 04:23:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-31 04:23:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 04:23:20,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:20,192 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:20,192 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1641347255, now seen corresponding path program 6 times [2018-12-31 04:23:20,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:20,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:20,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:20,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:20,317 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 [2018-12-31 04:23:20,334 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 04:23:20,446 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-31 04:23:20,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:20,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:20,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:20,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-31 04:23:20,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 04:23:20,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 04:23:20,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:23:20,504 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2018-12-31 04:23:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:20,607 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-31 04:23:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 04:23:20,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-31 04:23:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:20,611 INFO L225 Difference]: With dead ends: 36 [2018-12-31 04:23:20,611 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 04:23:20,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:23:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 04:23:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-31 04:23:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 04:23:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-12-31 04:23:20,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2018-12-31 04:23:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:20,618 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-12-31 04:23:20,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 04:23:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-12-31 04:23:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:23:20,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:20,620 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:20,620 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:20,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1020317689, now seen corresponding path program 7 times [2018-12-31 04:23:20,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:20,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:20,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:20,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:20,802 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 [2018-12-31 04:23:20,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:20,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:20,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:20,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-31 04:23:20,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 04:23:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 04:23:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:23:20,887 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 11 states. [2018-12-31 04:23:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:20,977 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-12-31 04:23:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:23:20,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-12-31 04:23:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:20,980 INFO L225 Difference]: With dead ends: 38 [2018-12-31 04:23:20,980 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 04:23:20,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:23:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 04:23:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-31 04:23:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 04:23:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-31 04:23:20,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2018-12-31 04:23:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:20,986 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-31 04:23:20,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 04:23:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-31 04:23:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:23:20,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:20,989 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:20,990 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1211358907, now seen corresponding path program 8 times [2018-12-31 04:23:20,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:20,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:20,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:21,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:21,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 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 [2018-12-31 04:23:21,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:23:21,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:23:21,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:21,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:21,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:21,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-31 04:23:21,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 04:23:21,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 04:23:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:23:21,607 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2018-12-31 04:23:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:21,716 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-12-31 04:23:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:23:21,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-12-31 04:23:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:21,724 INFO L225 Difference]: With dead ends: 40 [2018-12-31 04:23:21,724 INFO L226 Difference]: Without dead ends: 31 [2018-12-31 04:23:21,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:23:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-31 04:23:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-31 04:23:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 04:23:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-31 04:23:21,730 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2018-12-31 04:23:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:21,731 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-31 04:23:21,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 04:23:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-31 04:23:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 04:23:21,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:21,734 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:21,734 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash -118375677, now seen corresponding path program 9 times [2018-12-31 04:23:21,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:21,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:21,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:21,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:22,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:22,118 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 [2018-12-31 04:23:22,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 04:23:22,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-31 04:23:22,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:22,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:22,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:22,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-31 04:23:22,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 04:23:22,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 04:23:22,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-31 04:23:22,353 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 13 states. [2018-12-31 04:23:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:22,462 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-31 04:23:22,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:23:22,465 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-12-31 04:23:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:22,465 INFO L225 Difference]: With dead ends: 42 [2018-12-31 04:23:22,465 INFO L226 Difference]: Without dead ends: 33 [2018-12-31 04:23:22,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-31 04:23:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-31 04:23:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-31 04:23:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 04:23:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-31 04:23:22,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2018-12-31 04:23:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:22,471 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-31 04:23:22,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 04:23:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-31 04:23:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 04:23:22,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:22,473 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:22,473 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2028479167, now seen corresponding path program 10 times [2018-12-31 04:23:22,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:22,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:22,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:22,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:22,673 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 [2018-12-31 04:23:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 04:23:22,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 04:23:22,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:22,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:22,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:22,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-12-31 04:23:22,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 04:23:22,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 04:23:22,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:23:22,750 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 14 states. [2018-12-31 04:23:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:22,884 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-31 04:23:22,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 04:23:22,885 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-12-31 04:23:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:22,886 INFO L225 Difference]: With dead ends: 44 [2018-12-31 04:23:22,887 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 04:23:22,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:23:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 04:23:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-31 04:23:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 04:23:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-31 04:23:22,893 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2018-12-31 04:23:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:22,895 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-31 04:23:22,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 04:23:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-31 04:23:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 04:23:22,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:22,896 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:22,896 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash 608069631, now seen corresponding path program 11 times [2018-12-31 04:23:22,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:22,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:22,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:22,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:22,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:23,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:23,238 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 [2018-12-31 04:23:23,249 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 04:23:23,450 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-12-31 04:23:23,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:23,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:23,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:23,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-12-31 04:23:23,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 04:23:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 04:23:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-31 04:23:23,494 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 15 states. [2018-12-31 04:23:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:23,559 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-12-31 04:23:23,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 04:23:23,560 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-12-31 04:23:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:23,561 INFO L225 Difference]: With dead ends: 46 [2018-12-31 04:23:23,561 INFO L226 Difference]: Without dead ends: 37 [2018-12-31 04:23:23,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-31 04:23:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-31 04:23:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-31 04:23:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 04:23:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-31 04:23:23,566 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2018-12-31 04:23:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:23,566 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-31 04:23:23,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 04:23:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-31 04:23:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 04:23:23,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:23,567 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:23,567 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash 300759869, now seen corresponding path program 12 times [2018-12-31 04:23:23,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:23,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:24,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:24,638 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 [2018-12-31 04:23:24,647 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 04:23:25,806 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-12-31 04:23:25,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:25,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:25,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:25,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-12-31 04:23:25,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 04:23:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 04:23:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-31 04:23:25,866 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 16 states. [2018-12-31 04:23:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:25,955 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-31 04:23:25,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 04:23:25,958 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-12-31 04:23:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:25,959 INFO L225 Difference]: With dead ends: 48 [2018-12-31 04:23:25,959 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 04:23:25,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-31 04:23:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 04:23:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-31 04:23:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 04:23:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-31 04:23:25,965 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2018-12-31 04:23:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:25,966 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-31 04:23:25,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 04:23:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-31 04:23:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 04:23:25,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:25,967 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:25,967 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1328822011, now seen corresponding path program 13 times [2018-12-31 04:23:25,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:25,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:25,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:25,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:26,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:26,323 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 [2018-12-31 04:23:26,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:26,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:26,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:26,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-12-31 04:23:26,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 04:23:26,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 04:23:26,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:23:26,430 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 17 states. [2018-12-31 04:23:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:26,538 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-31 04:23:26,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 04:23:26,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-12-31 04:23:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:26,540 INFO L225 Difference]: With dead ends: 50 [2018-12-31 04:23:26,540 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 04:23:26,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:23:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 04:23:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-31 04:23:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 04:23:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-31 04:23:26,547 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2018-12-31 04:23:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:26,549 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-31 04:23:26,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 04:23:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-31 04:23:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 04:23:26,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:26,551 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:26,551 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1454062393, now seen corresponding path program 14 times [2018-12-31 04:23:26,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:26,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:26,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:26,933 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 [2018-12-31 04:23:26,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:23:26,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:23:26,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:26,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:27,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:27,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-12-31 04:23:27,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 04:23:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 04:23:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-31 04:23:27,012 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 18 states. [2018-12-31 04:23:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:27,080 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-31 04:23:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 04:23:27,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-31 04:23:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:27,082 INFO L225 Difference]: With dead ends: 52 [2018-12-31 04:23:27,082 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 04:23:27,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-31 04:23:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 04:23:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-31 04:23:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 04:23:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-31 04:23:27,089 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2018-12-31 04:23:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:27,089 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-31 04:23:27,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 04:23:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-31 04:23:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 04:23:27,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:27,092 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:27,093 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1550985207, now seen corresponding path program 15 times [2018-12-31 04:23:27,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:27,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:27,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:27,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:27,996 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 [2018-12-31 04:23:28,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 04:23:29,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-31 04:23:29,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:29,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:29,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:29,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-12-31 04:23:29,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 04:23:29,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 04:23:29,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:23:29,593 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 19 states. [2018-12-31 04:23:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:29,673 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-12-31 04:23:29,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 04:23:29,675 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-12-31 04:23:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:29,676 INFO L225 Difference]: With dead ends: 54 [2018-12-31 04:23:29,676 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 04:23:29,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:23:29,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 04:23:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-31 04:23:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 04:23:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-31 04:23:29,680 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 41 [2018-12-31 04:23:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:29,681 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-31 04:23:29,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 04:23:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-31 04:23:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 04:23:29,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:29,687 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:29,687 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:29,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 204528949, now seen corresponding path program 16 times [2018-12-31 04:23:29,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:29,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:29,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:29,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:29,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:30,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:30,044 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 [2018-12-31 04:23:30,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 04:23:30,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 04:23:30,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:30,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:30,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:30,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-12-31 04:23:30,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 04:23:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 04:23:30,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-31 04:23:30,145 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 20 states. [2018-12-31 04:23:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:30,278 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-31 04:23:30,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 04:23:30,280 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-12-31 04:23:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:30,280 INFO L225 Difference]: With dead ends: 56 [2018-12-31 04:23:30,281 INFO L226 Difference]: Without dead ends: 47 [2018-12-31 04:23:30,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-31 04:23:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-31 04:23:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-31 04:23:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 04:23:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-31 04:23:30,289 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 43 [2018-12-31 04:23:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:30,290 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-31 04:23:30,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 04:23:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-31 04:23:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 04:23:30,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:30,291 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:30,291 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:30,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:30,291 INFO L82 PathProgramCache]: Analyzing trace with hash -954778893, now seen corresponding path program 17 times [2018-12-31 04:23:30,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:30,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:30,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:30,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:30,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 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 [2018-12-31 04:23:30,578 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 04:23:32,212 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-12-31 04:23:32,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:32,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:32,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:32,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-12-31 04:23:32,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 04:23:32,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 04:23:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-31 04:23:32,283 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 21 states. [2018-12-31 04:23:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:32,594 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-31 04:23:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 04:23:32,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-12-31 04:23:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:32,596 INFO L225 Difference]: With dead ends: 58 [2018-12-31 04:23:32,596 INFO L226 Difference]: Without dead ends: 49 [2018-12-31 04:23:32,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-31 04:23:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-31 04:23:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-31 04:23:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-31 04:23:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-31 04:23:32,602 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-12-31 04:23:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:32,604 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-31 04:23:32,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 04:23:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-31 04:23:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 04:23:32,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:32,605 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:32,605 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1641881905, now seen corresponding path program 18 times [2018-12-31 04:23:32,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:32,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:32,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:32,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:32,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:32,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:32,938 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 [2018-12-31 04:23:32,950 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 04:23:42,291 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-12-31 04:23:42,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:42,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:42,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:42,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-12-31 04:23:42,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 04:23:42,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 04:23:42,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-31 04:23:42,357 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 22 states. [2018-12-31 04:23:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:42,512 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-31 04:23:42,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 04:23:42,513 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-12-31 04:23:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:42,513 INFO L225 Difference]: With dead ends: 60 [2018-12-31 04:23:42,514 INFO L226 Difference]: Without dead ends: 51 [2018-12-31 04:23:42,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-31 04:23:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-31 04:23:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-31 04:23:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 04:23:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-12-31 04:23:42,518 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 47 [2018-12-31 04:23:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:42,519 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-12-31 04:23:42,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 04:23:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-12-31 04:23:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 04:23:42,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:42,522 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:42,522 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:42,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:42,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1656909807, now seen corresponding path program 19 times [2018-12-31 04:23:42,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:42,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:42,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:43,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:43,084 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 [2018-12-31 04:23:43,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:43,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:43,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:43,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-12-31 04:23:43,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-31 04:23:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-31 04:23:43,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-31 04:23:43,183 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 23 states. [2018-12-31 04:23:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:43,421 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-31 04:23:43,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-31 04:23:43,422 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-12-31 04:23:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:43,423 INFO L225 Difference]: With dead ends: 61 [2018-12-31 04:23:43,423 INFO L226 Difference]: Without dead ends: 52 [2018-12-31 04:23:43,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-31 04:23:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-31 04:23:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-31 04:23:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-31 04:23:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-31 04:23:43,429 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2018-12-31 04:23:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:43,431 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-31 04:23:43,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-31 04:23:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-31 04:23:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 04:23:43,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:43,432 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:43,432 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1081145555, now seen corresponding path program 20 times [2018-12-31 04:23:43,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:43,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:43,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:23:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:23:43,611 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:23:43,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:23:43 BoogieIcfgContainer [2018-12-31 04:23:43,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:23:43,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:23:43,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:23:43,660 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:23:43,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:17" (3/4) ... [2018-12-31 04:23:43,665 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 04:23:43,750 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:23:43,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:23:43,751 INFO L168 Benchmark]: Toolchain (without parser) took 27478.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -121.6 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:43,756 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:23:43,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:43,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.50 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:23:43,765 INFO L168 Benchmark]: Boogie Preprocessor took 129.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -124.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:43,766 INFO L168 Benchmark]: RCFGBuilder took 471.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:43,766 INFO L168 Benchmark]: TraceAbstraction took 26357.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.2 MB). Peak memory consumption was 133.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:43,767 INFO L168 Benchmark]: Witness Printer took 90.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:43,774 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.22 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 372.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.50 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -124.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 471.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26357.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.2 MB). Peak memory consumption was 133.5 MB. Max. memory is 11.5 GB. * Witness Printer took 90.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND FALSE !(j<20) [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) [L27] COND FALSE !(i < *pa) [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. UNSAFE Result, 26.2s OverallTime, 22 OverallIterations, 20 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 259 SDtfs, 210 SDslu, 1430 SDs, 0 SdLazy, 618 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 822 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=21, 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, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 14.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1250 NumberOfCodeBlocks, 1250 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 1159 ConstructedInterpolants, 0 QuantifiedInterpolants, 95961 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2641 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4940 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...